628 search results - page 58 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
152
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
120
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
101
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
122
click to vote
ICRA
2008
IEEE
15 years 9 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
156
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...