Sciweavers

88 search results - page 2 / 18
» Approximate Range Searching Using Binary Space Partitions
Sort
View
DEXA
2006
Springer
190views Database» more  DEXA 2006»
13 years 8 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
ISBI
2004
IEEE
14 years 5 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
COMPGEOM
2009
ACM
13 years 11 months ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
13 years 10 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
SIGMOD
1999
ACM
125views Database» more  SIGMOD 1999»
13 years 9 months ago
Selectivity Estimation in Spatial Databases
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
Swarup Acharya, Viswanath Poosala, Sridhar Ramaswa...