Sciweavers

298 search results - page 23 / 60
» Approximate Inference and Constrained Optimization
Sort
View
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
13 years 11 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
UAI
2003
13 years 9 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 2 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
JCB
2007
92views more  JCB 2007»
13 years 7 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran
JMLR
2010
140views more  JMLR 2010»
13 years 2 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman