3055 search results - page 281 / 611 » Randomized Search Trees |
211
Voted
ICDE
2004
IEEE
16 years 4 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. ...
137
Voted
GLOBECOM
2007
IEEE
15 years 9 months 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...
129
click to vote
CPAIOR
2007
Springer
15 years 9 months 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...
145
click to vote
NIPS
2004
15 years 4 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...
107
click to vote
COMPSAC
2006
IEEE
15 years 9 months ago
2006
IEEE
Model-checking techniques are successfully used in the verification of both hardware and software systems of industrial relevance. Unfortunately, the capability of current techni...