402 search results - page 35 / 81 » Nearest Surrounder Queries |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
SSD
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
ICIP
2007
IEEE
14 years 9 months ago
2007
IEEE
We present a novel expert-model of Query-Driven Locally Adaptive (QDLA) Fisher faces for robust face recognition. For each query face, the proposed method first fits local Fisher ...