3082 search results - page 162 / 617 » New Bounds for the Controller Problem |
142
click to vote
JAIR
2011
14 years 7 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
140
click to vote
ER
2007
Springer
15 years 10 months ago
2007
Springer
The tutorial first addresses requirements and semantic problems to integrate digital information into large scale, meaningful networks of knowledge that support not only access to...
128
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
162
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
136
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...