Sciweavers

230 search results - page 9 / 46
» Data Structures for Restricted Triangular Range Searching
Sort
View
SSDBM
2009
IEEE
192views Database» more  SSDBM 2009»
15 years 4 months ago
MLR-Index: An Index Structure for Fast and Scalable Similarity Search in High Dimensions
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
Rahul Malik, Sangkyum Kim, Xin Jin, Chandrasekar R...
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 11 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
CN
2004
148views more  CN 2004»
14 years 9 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
14 years 11 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
70
Voted
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
14 years 11 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee