Sciweavers

1376 search results - page 85 / 276
» Searching Trees: An Essay
Sort
View
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 7 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...
ENTCS
2000
123views more  ENTCS 2000»
15 years 6 months ago
Defining Standard Prolog in Rewriting Logic
The coincidence between the model-theoretic and the procedural semantics of SLDresolution does not carry over to a Prolog system that also implements non-logical features like cut...
Marija Kulas, Christoph Beierle
PRL
2006
96views more  PRL 2006»
15 years 6 months ago
Fast codebook search algorithms based on tree-structured vector quantization
Tree-Structured Vector Quantization (TSVQ) is a highly efficient technique for locating an appropriate codeword for each input vector. The algorithm does not guarantee that the sel...
Chin-Chen Chang, Yu-Chiang Li, Jun-Bin Yeh
CSR
2006
Springer
15 years 10 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park