Sciweavers

84 search results - page 6 / 17
» Finding the Nearest Neighbors in Biological Databases Using ...
Sort
View
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
13 years 11 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...
BTW
2007
Springer
183views Database» more  BTW 2007»
13 years 11 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
GIS
2003
ACM
14 years 8 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo
CVPR
2004
IEEE
14 years 9 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
SIGMOD
2005
ACM
109views Database» more  SIGMOD 2005»
14 years 7 months ago
Query-Sensitive Embeddings
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...
Vassilis Athitsos, Marios Hadjieleftheriou, George...