57 search results - page 9 / 12 » Closest point search in lattices |
COMPGEOM
2004
ACM
14 years 25 days ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
HOTOS
2007
IEEE
13 years 11 months ago
2007
IEEE
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
High energy traumatic impact of the craniofacial skeleton is an inevitable consequence of today's fast paced society. The work presented in this paper leverages recent advanc...