331 search results - page 60 / 67 » Approximation Algorithms for Connected Dominating Sets |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
106
click to vote
ALENEX
2009
15 years 24 days ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
KDD
2003
ACM
16 years 2 days ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
103
click to vote
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
133
click to vote
SIGECOM
2011
ACM
14 years 2 months ago
2011
ACM
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...