985 search results - page 132 / 197 » Piercing Convex Sets |
131
click to vote
NIPS
2008
15 years 6 months ago
2008
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
121
Voted
MASCOTS
2007
15 years 6 months ago
2007
Abstract— Wireless Mesh Networks are a scalable and costeffective solution for next-generation wireless networking. In the present work, we consider the Round Weighting Problem (...
124
click to vote
NIPS
2007
15 years 6 months ago
2007
We propose a Bayesian undirected graphical model for co-training, or more generally for semi-supervised multi-view learning. This makes explicit the previously unstated assumption...
133
Voted
IPCO
2004
15 years 6 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
147
Voted
NIPS
2001
15 years 6 months ago
2001
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...