958 search results - page 47 / 192 » Efficient data structures for range-aggregate queries on tre... |
96
Voted
ESA
2000
Springer
15 years 4 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
139
click to vote
ICML
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
112
click to vote
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
147
click to vote
DASFAA
2004
IEEE
15 years 4 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
138
click to vote
CIKM
2006
Springer
15 years 4 months ago
2006
Springer
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...