3341 search results - page 88 / 669 » On Bounded Queries and Approximation |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
We analyze a simple, Bellman-error-based approach to generating basis functions for valuefunction approximation. We show that it generates orthogonal basis functions that provably...
GCB
2004
Springer
15 years 3 months ago
2004
Springer
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
JAT
2007
14 years 9 months ago
2007
We prove sharp bounds for the expectation of the supremum of the Gaussian process indexed by the intersection of Bn p with ρBn q for 1 ≤ p, q ≤ ∞ and ρ > 0, and by the ...
UAI
2008
14 years 11 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...