7930 search results - page 275 / 1586 » Greedy in Approximation Algorithms |
559
click to vote
ICA
2012
Springer
14 years 2 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
124
click to vote
ESANN
2000
15 years 8 months ago
2000
Iterative algorithm based on quantum tunneling is proposed by making use of mean- eld approximation. W e apply our method to the problem of BW image reconstruction (IR). Its perfor...
185
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
208
click to vote
SPAA
2004
ACM
16 years 15 hour ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
164
click to vote
WADS
2005
Springer
16 years 2 days ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...