1518 search results - page 174 / 304 » Exact and Approximate Bandwidth |
119
click to vote
NIPS
2008
14 years 11 months ago
2008
The Singular Value Decomposition is a key operation in many machine learning methods. Its computational cost, however, makes it unscalable and impractical for applications involvi...
NIPS
2008
14 years 11 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
NIPS
2008
14 years 11 months ago
2008
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
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 investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...