564 search results - page 66 / 113 » Approximation algorithms for restricted Bayesian network str... |
221
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...
110
click to vote
JMLR
2006
15 years 17 days ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
99
Voted
ESA
2000
Springer
15 years 4 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
100
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
90
Voted
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...