Sciweavers

209 search results - page 7 / 42
» t-Spanners for metric space searching
Sort
View
CIKM
2008
Springer
15 years 3 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
CORR
2010
Springer
249views Education» more  CORR 2010»
15 years 1 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 5 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
122
Voted
DATESO
2010
153views Database» more  DATESO 2010»
14 years 11 months ago
Answering Metric Skyline Queries by PM-tree
Abstract. The task of similarity search in multimedia databases is usually accomplished by range or k nearest neighbor queries. However, the expressing power of these "single-...
Tomás Skopal, Jakub Lokoc
ADC
2003
Springer
127views Database» more  ADC 2003»
15 years 7 months ago
M+-tree : A New Dynamical Multidimensional Index for Metric Spaces
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
Xiangmin Zhou, Guoren Wang, Jeffrey Xu Yu, Ge Yu