958 search results - page 87 / 192 » Efficient data structures for range-aggregate queries on tre... |
104
click to vote
ICDE
2002
IEEE
15 years 3 months ago
2002
IEEE
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
COMPGEOM
1994
ACM
15 years 2 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
GIR
2006
ACM
15 years 4 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
118
Voted
BMCBI
2006
14 years 10 months ago
2006
Background: Owing to the rapid expansion of RNA structure databases in recent years, efficient methods for structure comparison are in demand for function prediction and evolution...