Sciweavers

1100 search results - page 63 / 220
» Approximate distance oracles
Sort
View
ICPR
2008
IEEE
15 years 4 months ago
Fast approximate kernel-based similarity search for image retrieval task
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
David Gorisse, Matthieu Cord, Frédér...
DAGSTUHL
1997
14 years 11 months ago
Interpolation and Approximation of Surfaces from Three-dimensional Scattered Data Points
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...
Robert Mencl, Heinrich Müller
COMPGEOM
2006
ACM
15 years 4 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 1 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
JDA
2007
97views more  JDA 2007»
14 years 10 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia