628 search results - page 73 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
124
click to vote
ECSQARU
2009
Springer
15 years 9 months ago
2009
Springer
To explore the Perturb and Combine idea for estimating probability densities, we study mixtures of tree structured Markov networks derived by bagging combined with the Chow and Liu...
110
click to vote
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
114
click to vote
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
128
click to vote
DCC
2001
IEEE
16 years 2 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
105
click to vote
TROB
2008
15 years 3 months ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...