57 search results - page 10 / 12 » Closest point search in lattices |
SISAP
2008
IEEE
15 years 6 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
DEXA
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
120
click to vote
ICDM
2002
IEEE
15 years 4 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
102
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper introduces a geometrically inspired large-margin classifier that can be a better alternative to the Support Vector Machines (SVMs) for the classification problems with ...
155
click to vote
PVLDB
2011
14 years 2 months ago
2011
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...