Sciweavers

1461 search results - page 70 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
SIGMOD
2003
ACM
152views Database» more  SIGMOD 2003»
16 years 1 days ago
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especial...
Hans-Peter Kriegel, Stefan Brecheisen, Peer Kr&oum...
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
15 years 6 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
FOCS
1989
IEEE
15 years 4 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
BIOCOMP
2007
15 years 1 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
AAAI
1998
15 years 1 months ago
Highest Utility First Search Across Multiple Levels of Stochastic Design
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
Louis I. Steinberg, J. Storrs Hall, Brian D. Davis...