47 search results - page 2 / 10 » A tight bound on approximating arbitrary metrics by tree met... |
191
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
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...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
116
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
JCSS
2006
14 years 11 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...