Sciweavers

511 search results - page 37 / 103
» TSP with bounded metrics
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 9 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
LICS
2007
IEEE
15 years 4 months ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 3 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
JMLR
2010
118views more  JMLR 2010»
14 years 4 months ago
Hilbert Space Embeddings and Metrics on Probability Measures
A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing, and independence testing....
Bharath K. Sriperumbudur, Arthur Gretton, Kenji Fu...
TALG
2010
158views more  TALG 2010»
14 years 4 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...