7930 search results - page 686 / 1586 » Greedy in Approximation Algorithms |
213
click to vote
ML
2007
ACM
15 years 7 months ago
2007
ACM
Abstract Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. A...
207
click to vote
EMMCVPR
2001
Springer
15 years 12 months ago
2001
Springer
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
273
click to vote
OOPSLA
2000
Springer
15 years 11 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
200
Voted
ESA
2008
Springer
15 years 9 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
201
Voted
UAI
2003
15 years 8 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...