|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2640 occurrences of 1541 keywords
|
|
|
|
|
Results
Found 4065 publication records. Showing 4065 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 4 | Mikkel Thorup |
Undirected Single Source Shortest Path in Linear Time.  |
FOCS  |
1997 |
DBLP DOI BibTeX RDF |
single source shortest paths problem, algorithmic graph theory, deterministic linear time, hierarchical bucketing, deterministic algorithms, linear time, weighted graph, Dijkstra's algorithm, linear space |
| 4 | Edmund M. Clarke, I. A. Draghicescu |
Expressibility results for linear-time and branching-time logics.  |
REX Workshop  |
1988 |
DBLP DOI BibTeX RDF |
linear-time logic, temporal logic, fairness, computation tree logics, branching-time logic |
| 3 | Marek Karpinski, Warren Schudy |
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
Gale-Berlekamp game, correlation and hierarchical clustering, dense instances, linear time approximation schemes, minimum constraint satisfaction, nearest codeword problem, approximation algorithms |
| 3 | Andreas Brandstädt, Chính T. Hoàng |
Maximum Induced Matchings for Chordal Graphs in Linear Time.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Maximum induced matchings, Perfect elimination order, Lexicographic breadth-first search, Chordal graphs, Linear time algorithm |
| 3 | Richard Cole, Lukasz Kowalik |
New Linear-Time Algorithms for Edge-Coloring Planar Graphs.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Algorithm, Planar graph, Edge-coloring, Linear-time |
| 3 | Ke Chen 0004, Shuai Yue, Yunong Zhang |
MATLAB Simulation and Comparison of Zhang Neural Network and Gradient Neural Network for Online Solution of Linear Time-Varying Matrix Equation AXB-C=0.  |
ICIC  |
2008 |
DBLP DOI BibTeX RDF |
Linear time-varying matrix equation, Gradient neural networks, MATLAB simulation, Recurrent neural networks, Efficacy |
| 3 | Ken-ichi Kawarabayashi, Bojan Mohar |
Graph and map isomorphism and all polyhedral embeddings in linear time.  |
STOC  |
2008 |
DBLP DOI BibTeX RDF |
map isomorphism, graph isomorphism, linear time algorithm |
| 3 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Computing crossing number in linear time.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
linear time algorithm, crossing number, tree-width |
| 3 | Iris Anshel, Michael Anshel, Dorian Goldfeld |
A Linear Time Matrix Key Agreement Protocol Over Small Finite Fields.  |
Appl. Algebra Eng. Commun. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
Colored Burau matrices, Small finite fields, Key agreement protocol, Linear time |
| 3 | Fen Xie, Margaret Martonosi, Sharad Malik |
Bounds on power savings using runtime dynamic voltage scaling: an exact algorithm and a linear-time heuristic approximation.  |
ISLPED  |
2005 |
DBLP DOI BibTeX RDF |
bounds on energy savings, low power, dynamic voltage scaling, linear time |
| 3 | Muhammad Arif, Tadashi Ishihara, Hikaru Inooka |
A Learning Control for a Class of Linear Time Varying Systems Using Double Differential of Error.  |
Journal of Intelligent and Robotic Systems  |
2003 |
DBLP DOI BibTeX RDF |
linear time varying system, convergence, learning control |
| 3 | Venkatesan Guruswami, Piotr Indyk |
Linear time encodable and list decodable codes.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
adversarial noise model, linear time computation, expander graphs, list decoding, spectral partitioning |
| 3 | Lilian Buzer |
An Incremental Linear Time Algorithm for Digital Line and Plane Recognition Using a Linear Incremental Feasibility Problem.  |
DGCI  |
2002 |
DBLP DOI BibTeX RDF |
digital line recognition, digital plane recognition, feasibility problem, linear time. Conference Topic: Models for Discrete Geometry, Type of Presentation: oral presentation, incremental |
| 3 | Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa |
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems.  |
ICFP  |
2000 |
DBLP DOI BibTeX RDF |
maximum-weightsum problem, mutumorphism, fusion, tupling, linear-time algorithm, program calculation |
| 3 | Sanjeev Arora |
Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems.  |
FOCS  |
1997 |
DBLP DOI BibTeX RDF |
randomized polynomial time approximation, Euclidean TSP, optimum traveling salesman tour, Euclidean problems, nearly-linear time approximation, randomized, Steiner Tree, parallel implementations, randomised algorithms, geometric problems |
| 3 | Julian C. Bradfield, Javier Esparza, Angelika Mader |
An Effective Tableau System for the Linear Time µ-Calculus.  |
ICALP  |
1996 |
DBLP DOI BibTeX RDF |
linear-time -calculus, local model-checking, temporal logic, tableau systems |
| 3 | Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh |
A linear-time algorithm for computing the diameters of the incomplete WK-recursive networks. (PDF / PS)  |
ICPADS  |
1996 |
DBLP DOI BibTeX RDF |
multistage graphs, prune-and-search technique, interconnection network, multiprocessor system, multistage interconnection networks, linear-time algorithm, WK-recursive networks |
| 3 | Eva Rose |
Linear Time Hierarchies for a Functional Language Machine Model.  |
ESOP  |
1996 |
DBLP DOI BibTeX RDF |
selective update, operational semantics, functional languages, structured data, CAM, linear time, complexity hierarchy |
| 3 | E. Allen Emerson, Jai Srinivasan |
Branching time temporal logic.  |
REX Workshop  |
1988 |
DBLP DOI BibTeX RDF |
Modal and Temporal Logic: Branching time temporal logic, linear time temporal logic, model checking - Logics of Programs: Reasoning about concurrent programs, specification of and reasoning about fairness - Software Engineering: Specification techniques, automated verification techniques - Computational Complexity, Automata Theory: Finite-state automata on infinite objects, program verification, satisfiability, decidability, expressiveness, decision procedures, dynamic logics, tree automata, axiomatics, program specification, mechanical synthesis |
| 2 | Ge Nong, Sen Zhang, Wai Hong Chan |
Two Efficient Algorithms for Linear Time Suffix Array Construction.  |
IEEE Trans. Computers  |
2011 |
DBLP DOI BibTeX RDF |
divide-and-conquer, Suffix array, linear time |
| 2 | Noga Alon, Shai Gutner |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms |
| 2 | Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas |
Linear time 3-approximation for the MAST problem.  |
ACM Transactions on Algorithms  |
2009 |
DBLP DOI BibTeX RDF |
maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree |
| 2 | Minghui Jiang |
A Linear-Time Algorithm for Hamming Distance with Shifts.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Swap distance, Combinatorial pattern matching, Hamming distance, String algorithm |
| 2 | Mukul S. Bansal, Oliver Eulenstein, André Wehe |
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches.  |
IEEE/ACM Trans. Comput. Biology Bioinform.  |
2009 |
DBLP DOI BibTeX RDF |
Computational phylogenetics, {tt NNI}, local search, gene-duplication, supertrees |
| 2 | Pinar Heggernes, Rodica Mihai |
Edge Search Number of Cographs in Linear Time.  |
FAW  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Torben Hagerup |
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees.  |
WG  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
A Linear Time Algorithm for L(2, 1)-Labeling of Trees.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Ross M. McConnell, Yahav Nussbaum |
Linear-Time Recognition of Probe Interval Graphs.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas |
Three-coloring triangle-free planar graphs in linear time.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | David Eppstein, Michael T. Goodrich, Darren Strash |
Linear-time algorithms for geometric graphs with sublinearly many crossings.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral parity disjoint paths packing problem.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | David R. Karger, Debmalya Panigrahi |
A near-linear time algorithm for constructing a cactus representation of minimum cuts.  |
SODA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Francesco Belardinelli, Alessio Lomuscio |
First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment.  |
WoLLIC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Shervin Erfani, Nima Bayan |
On linear time-varying system characterizations.  |
EIT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Hrishikesh B. Acharya, Mohamed G. Gouda |
Linear-Time Verification of Firewalls.  |
ICNP  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Michael Brinkmeier |
Minimum Cuts of Simple Graphs in Almost Always Linear Time.  |
WALCOM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Alejandro Veloz, Héctor Allende-Cid, Héctor Allende, Claudio Moraga, Rodrigo Salas |
A Flexible Neuro-Fuzzy Autoregressive Technique for Non-linear Time Series Forecasting.  |
KES  |
2009 |
DBLP DOI BibTeX RDF |
Non-linear Autoregressive Time Series, Flexible and Incremental learning, Neuro-fuzzy models |
| 2 | Srecko Brlek, Michel Koskas, Xavier Provençal |
A Linear Time and Space Algorithm for Detecting Path Intersection.  |
DGCI  |
2009 |
DBLP DOI BibTeX RDF |
Freeman code, lattice paths, radix tree, discrete figures, data structure, self-intersection |
| 2 | Xavier Provençal, Jacques-Olivier Lachaud |
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour.  |
DGCI  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Ge Nong, Sen Zhang, Wai Hong Chan |
Linear Time Suffix Array Construction Using D-Critical Substrings.  |
CPM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Ryohei Fujimaki, Satoshi Morinaga, Michinari Momma, Kenji Aoki, Takayuki Nakata |
Linear Time Model Selection for Mixture of Heterogeneous Components.  |
ACML  |
2009 |
DBLP DOI BibTeX RDF |
heterogeneous mixture model, model selection, minimum description length |
| 2 | Bianca Boretti, Sara Negri |
Decidability for Priorean Linear Time Using a Fixed-Point Labelled Calculus.  |
TABLEAUX  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Jun Liu, Jieping Ye |
Efficient Euclidean projections in linear time.  |
ICML  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Valentin Goranko, Dmitry Shkatov |
Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time.  |
AAMAS  |
2009 |
DBLP DOI BibTeX RDF |
logics for multi-agent systems, decision procedures, tableaux |
| 2 | Matthew Hayes, Jing Li |
A Linear-Time Algorithm for Analyzing Array CGH Data Using Log Ratio Triangulation.  |
ISBRA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Ken-ichi Kawarabayashi |
Planarity Allowing Few Error Vertices in Linear Time.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
Few errors, Approximation Algorithms, TSP, Planarity, linear time |
| 2 | Gábor Enyedi, Gábor Rétvári, András Császár |
On Finding maximally redundant trees in strictly linear time.  |
ISCC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Domenico Cantone, Simone Faro |
Pattern Matching with Swaps for Short Patterns in Linear Time.  |
SOFSEM  |
2009 |
DBLP DOI BibTeX RDF |
pattern matching with swaps, nonstandard pattern matching, design and analysis of algorithms, combinatorial algorithms on words |
| 2 | Tomoyuki Yamakami |
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract).  |
ISAAC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Silvana Petruseva |
Forward Chaining Algorithm for Solving the Shortest Path Problem in Arbitrary Deterministic Environment in Linear Time - Applied for the Tower of Hanoi Problem.  |
KI  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Pawel Gawrychowski, Travis Gagie |
Minimax Trees in Linear Time with Applications.  |
IWOCA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Daisuke Okanohara, Kunihiko Sadakane |
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting.  |
SPIRE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Alexandr Andoni, Krzysztof Onak |
Approximating edit distance in near-linear time.  |
STOC  |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, edit distance, metric embeddings |
| 2 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs.  |
Graph Theory, Computational Intelligence and Thought  |
2009 |
DBLP DOI BibTeX RDF |
P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs |
| 2 | Amélie Gheerbrant, Balder ten Cate |
Craig Interpolation for Linear Temporal Languages.  |
CSL  |
2009 |
DBLP DOI BibTeX RDF |
Propositional Linear Temporal Logic, Linear Time ?-Calculus, Craig Interpolation |
| 2 | Fernando Pérez-González, Carlos Mosquera |
Quantization-Based Data Hiding Robust to Linear-Time-Invariant Filtering.  |
IEEE Transactions on Information Forensics and Security  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Wim H. Hesselink, Jos B. T. M. Roerdink |
Euclidean Skeletons of Digital Image and Volume Data in Linear Time by the Integer Medial Axis Transform.  |
IEEE Trans. Pattern Anal. Mach. Intell.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | André Berger, Ojas Parekh |
Linear Time Algorithms for Generalized Edge Dominating Set Problems.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Trees, Edge dominating set |
| 2 | Christoph Buchheim, Seok-Hee Hong |
Testing Planarity of Geometric Automorphisms in Linear Time.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Symmetries, Graph drawing, Planarity, Automorphisms |
| 2 | V. Berry, Z. S. Peng, H. F. Ting |
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Maximum agreement subtrees, Constrained maximum agreement subtrees, Bioinformatics, Consensus, Reduction, Evolutionary trees |
| 2 | Do-Sik Yoo |
Equivalent Complex Baseband Representations of Linear Time-Variant Systems and Signals.  |
IEEE Transactions on Signal Processing  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Andreas Brandstädt, Van Bang Le, R. Sritharan |
Structure and linear-time recognition of 4-leaf powers.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
squares of trees, trees, phylogenetic trees, leaf powers, Graph powers |
| 2 | Sari Onaissi, Farid N. Najm |
A Linear-Time Approach for Static Timing Analysis Covering All Process Corners.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Chaoba Nikkie Anand, Caterina M. Scoglio, Balasubramaniam Natarajan |
GARCH - non-linear time series model for traffic modeling and prediction.  |
NOMS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Jun Jun Zhang, Antonia S. Papandreou |
Compressive sensing and waveform design for the identification of Linear time-varying systems.  |
ICASSP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Davide Bilò, Luca Forlizzi, Guido Proietti |
Approximating the Metric TSP in Linear Time.  |
WG  |
2008 |
DBLP DOI BibTeX RDF |
Metric Graphs, Linear-time Approximation Algorithms, NP-hardness, Traveling Salesman Problem |
| 2 | Norihiro Kamide |
Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic.  |
CLIMA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Christian Bachmaier, Wolfgang Brunner |
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs.  |
ESA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Mingxuan Sun |
On Initial Rectifying Learning for Linear Time-Invariant Systems with Rank-Defective Markov Parameters.  |
ICIC  |
2008 |
DBLP DOI BibTeX RDF |
Initial shift problem, rank-defective Markov parameters, convergence, learning algorithms |
| 2 | Mark A. Iwen |
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Shay Mozes, Krzysztof Onak, Oren Weimann |
Finding an optimal tree searching strategy in linear time.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Yuval Emek, David Peleg, Liam Roditty |
A near-linear time algorithm for computing replacement paths in planar directed graphs.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral disjoint paths packing.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul |
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | J. V. R. Ravindra, M. B. Srinivas |
Generic sub-space algorithm for generating reduced order models of linear time varying vlsi circuits.  |
ACM Great Lakes Symposium on VLSI  |
2008 |
DBLP DOI BibTeX RDF |
krylov subspace techniques, monte-carlo simulation, model order reduction, rlc |
| 2 | Li Chen, Yongwu Rong |
Linear time recognition algorithms for topological invariants in 3D.  |
ICPR  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Bruce A. Reed, Zhentao Li |
Optimization and Recognition for K 5-minor Free Graphs in Linear Time.  |
LATIN  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Maarten Löffler, Jack Snoeyink |
Delaunay triangulations of imprecise pointsin linear time after preprocessing.  |
Symposium on Computational Geometry  |
2008 |
DBLP DOI BibTeX RDF |
data imprecision, delaunay triangulation, minimum spanning tree, gabriel graph |
| 2 | Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski |
Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem.  |
WALCOM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Md. Abul Hassan Samee, Mohammad Tanvir Irfan, Md. Saidur Rahman |
Computing beta -Drawings of 2-Outerplane Graphs in Linear Time.  |
WALCOM  |
2008 |
DBLP DOI BibTeX RDF |
Proximity Drawing, ?-Drawing, Proximity Graph, 2-Outerplane graph, Slicing Path, Good Slicing Path, Graph Drawing |
| 2 | Carlo A. Furia, Paola Spoletini |
Practical Efficient Modular Linear-Time Model-Checking.  |
ATVA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Germain Garcia, Pedro Luis Dias Peres, Sophie Tarbouriech |
Necessary and sufficient numerical conditions for asymptotic stability of linear time-varying systems.  |
CDC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Yang Tian, Thierry Floquet, Wilfrid Perruquetti |
Fast state estimation in linear time-varying systems: An algebraic approach.  |
CDC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Giuseppe Conte, Anna Maria Perdon, Elena Zattoni |
The autonomous regulator problem for linear, time-delay systems: A geometric approach.  |
CDC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Sandip Roy, Yan Wan, Ali Saberi, Babak Malek |
An alternative approach to designing stabilizing compensators for saturating linear time-invariant plants.  |
CDC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Luís Monteiro |
A Coalgebraic Characterization of Behaviours in the Linear Time - Branching Time Spectrum.  |
WADT  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Laura Bozzelli, Ruggero Lanotte |
Complexity and Succinctness Issues for Linear-Time Hybrid Logics.  |
JELIA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter |
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs.  |
SWAT  |
2008 |
DBLP DOI BibTeX RDF |
proper circular-arc graphs, proper circular-arc canonization, isomorphism problems |
| 2 | Fritz Henglein |
Generic discrimination: sorting and paritioning unshared data in linear time.  |
ICFP  |
2008 |
DBLP DOI BibTeX RDF |
multiset discrimination, total preorder, partitioning, generic, sorting, functional, equivalence, discrimination, discriminator, order |
| 2 | Ofir Pele, Michael Werman |
A Linear Time Histogram Metric for Improved SIFT Matching.  |
ECCV  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | David Nistér, Henrik Stewénius |
Linear Time Maximally Stable Extremal Regions.  |
ECCV  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Sameer Shirdhonkar, David W. Jacobs |
Approximate earth mover's distance in linear time.  |
CVPR  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ariel Cohen 0002, Kedar S. Namjoshi |
Local Proofs for Linear-Time Properties of Concurrent Programs.  |
CAV  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Mukul S. Bansal, Oliver Eulenstein |
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches.  |
ISBRA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed |
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width.  |
FOCS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Seungmoon Song, Daesung Hwang, Sunglock Seo, Jeongseok Ha |
Linear-Time Encodable Rate-Compatible Punctured LDPC Codes with Low Error Floors.  |
VTC Spring  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Katerina Asdre, Stavros D. Nikolopoulos |
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs.  |
FAW  |
2008 |
DBLP DOI BibTeX RDF |
fixed-endpoint path cover, complement reducible graphs, linear-time algorithms, perfect graphs, cographs, path cover |
| 2 | Sudipto Guha, Kyuseok Shim |
A Note on Linear Time Algorithms for Maximum Error Histograms.  |
IEEE Trans. Knowl. Data Eng.  |
2007 |
DBLP DOI BibTeX RDF |
algorithms, Histograms |
| 2 | Jingui Huang, Jianer Chen, Songqiao Chen, Jianxin Wang |
A simple linear time approximation algorithm for multi-processor job scheduling on four processors.  |
J. Comb. Optim.  |
2007 |
DBLP DOI BibTeX RDF |
Multi-processor job scheduling, Approximation algorithm, NP-hard problem |
| 2 | Paola Bonizzoni |
A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem.  |
Algorithmica  |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 4065 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|