416 search results - page 47 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
UAI
2004
13 years 10 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
JMLR
2006
13 years 8 months ago
2006
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
EEF
2000
14 years 9 days ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
AAAI
2006
13 years 10 months ago
2006
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...