324 search results - page 30 / 65 » Distance Approximating Trees: Complexity and Algorithms |
148
Voted
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
112
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
140
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
111
click to vote
JAIR
2008
15 years 3 months ago
2008
Machine learning techniques are gaining prevalence in the production of a wide range of classifiers for complex real-world applications with nonuniform testing and misclassificati...
143
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...