1376 search results - page 135 / 276 » Searching Trees: An Essay |
188
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
262
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
190
click to vote
GLOBECOM
2007
IEEE
16 years 24 days ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
179
click to vote
CPAIOR
2007
Springer
16 years 19 days ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
194
click to vote
NIPS
2004
15 years 7 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...