Search Sciweavers | Sciweavers

462 search results - page 23 / 93

» Covering a Tree by a Forest

click to vote

SODA
2004
ACM

144views Algorithms» more SODA 2004»

Covering minimum spanning trees of random subgraphs

13 years 8 months ago

Download www-math.mit.edu

We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...

Michel X. Goemans, Jan Vondrák

claim paper

Read More »

click to vote

ICML
2006
IEEE

522views Machine Learning» more ICML 2006»

Cover Trees for Nearest Neighbor

14 years 4 months ago

Download hunch.net

We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...

Alina Beygelzimer, Sham Kakade, John Langford

posted by olethros

Read More »

click to vote

CVPR
2010
IEEE

417views Computer Vision» more CVPR 2010»

Covering Trees and Lower-bounds on Quadratic Assignment

14 years 3 months ago

Download www.ics.uci.edu

Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...

Julian Yarkony, Charless Fowlkes, Alex Ihler

claim paper

Read More »

click to vote

STOC
2005
ACM

89views Algorithms» more STOC 2005»

Universal approximations for TSP, Steiner tree, and set cover

14 years 7 months ago

Download www.ccs.neu.edu

Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R...

claim paper

Read More »