126 search results - page 5 / 26 » A Framework for Efficient Minimum Distance Computations |
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
An interactive framework for soft segmentation and matting of natural images and videos is presented in this paper. The proposed technique is based on the optimal, linear time, co...
EWSN
2007
Springer
14 years 8 months ago
2007
Springer
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
IJCV
2006
13 years 8 months ago
2006
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...