Sciweavers

PODS
1998
ACM
152views Database» more  PODS 1998»
13 years 8 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
ICALP
2010
Springer
13 years 9 months ago
Clustering with Diversity
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
Jian Li, Ke Yi, Qin Zhang
ICALP
2003
Springer
13 years 9 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
WEA
2005
Springer
97views Algorithms» more  WEA 2005»
13 years 10 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...
SPIRE
2005
Springer
13 years 10 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
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...
Rodrigo Paredes, Edgar Chávez
DBISP2P
2005
Springer
172views Database» more  DBISP2P 2005»
13 years 10 months ago
A Content-Addressable Network for Similarity Search in Metric Spaces
In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content– addressable Network (CAN) parad...
Fabrizio Falchi, Claudio Gennaro, Pavel Zezula
SISAP
2008
IEEE
153views Data Mining» more  SISAP 2008»
13 years 11 months ago
Counting Distance Permutations
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
Matthew Skala
ISMVL
2008
IEEE
126views Hardware» more  ISMVL 2008»
13 years 11 months ago
Betweenness, Metrics and Entropies in Lattices
We investigate a class of metrics on lattices that are compatible with the partial order defined by the lattice using the ternary relation of betweenness that can be naturally de...
Dan A. Simovici
ESAW
2009
Springer
13 years 11 months ago
PreSage-MS: Metric Spaces in PreSage
Abstract. We consider adaptation in open systems, i.e. systems without global objects or common objectives. There are three related issues: how to make the degrees of freedom (DoFs...
Hugo Carr, Alexander Artikis, Jeremy Pitt
SISAP
2009
IEEE
155views Data Mining» more  SISAP 2009»
13 years 11 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