184 search results - page 25 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
NAR
2010
14 years 6 months ago
2010
As the amount of biological data grows, so does the need for biologists to store and access this information in central repositories in a free and unambiguous manner. The European...
120
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
113
click to vote
JFR
2007
14 years 11 months ago
2007
Urban Search And Rescue (USAR) is a time critical task. Rescue teams have to explore a large terrain within a short amount of time in order to locate survivors after a disaster. O...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
211
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...