Sciweavers

135 search results - page 1 / 27
» Approximability Distance in the Space of H-Colourability Pro...
Sort
View
63
Voted
CSR
2009
Springer
15 years 4 months ago
Approximability Distance in the Space of H-Colourability Problems
Tommy Färnqvist, Peter Jonsson, Johan Thapper
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
15 years 1 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
TODS
2002
92views more  TODS 2002»
14 years 9 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 3 months ago
On Approximating the Average Distance Between Points
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
Kfir Barhum, Oded Goldreich, Adi Shraibman
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
15 years 7 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...