277 search results - page 33 / 56 » Opportunistic Data Structures for Range Queries |
300
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
252
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Abstract Peer-to-peer (P2P) networks have become a powerful means for online data exchange. Currently, users are primarily utilizing these networks to perform exact-match queries a...
255
click to vote
IR
2008
15 years 5 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
152
click to vote
COMPGEOM
2010
ACM
15 years 11 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...
279
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techni...