Sciweavers

4106 search results - page 15 / 822
» A Computational Model for Metric Spaces
Sort
View
SEBD
1997
158views Database» more  SEBD 1997»
13 years 9 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
FOCS
2007
IEEE
13 years 11 months ago
Local Global Tradeoffs in Metric Embeddings
Suppose that every k points in a n point metric space X are D-distortion embed
Moses Charikar, Konstantin Makarychev, Yury Makary...
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
14 years 2 months ago
Analyzing Metric Space Indexes: What For?
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
Gonzalo Navarro
DAM
2008
68views more  DAM 2008»
13 years 7 months ago
Multiple packing in sum-type metric spaces
We present the exact solution of the asymptotics of the multiple packing problem in a finite space with a sum-type metric. 1 Consider the space Qn of n-tuples over a finite set Q ...
Rudolf Ahlswede, Vladimir Blinovsky
WEA
2005
Springer
97views Algorithms» more  WEA 2005»
14 years 1 months ago
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
Domenico Cantone, Alfredo Ferro, Rosalba Giugno, G...