3341 search results - page 156 / 669 » On Bounded Queries and Approximation |
IPL
2010
14 years 8 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
SIAMMA
2010
14 years 4 months ago
2010
Abstract. On product domains, sparse-grid approximation yields optimal, dimension-independent convergence rates when the function that is approximated has L2-bounded mixed derivati...
NIPS
2008
14 years 11 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 ...
NIPS
2007
14 years 11 months ago
2007
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
ICDIM
2008
IEEE
15 years 4 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....