69 search results - page 1 / 14 » Proximity Algorithms for Nearly-Doubling Spaces |
APPROX
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
MICAI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
SIAMJO
2011
12 years 11 months ago
2011
This paper is concerned with the study of a class of prox-penalization methods for solving variational inequalities of the form Ax + NC (x) 0 where H is a real Hilbert space, A : H...