4843 search results - page 74 / 969 » The Shortcut Problem - Complexity and Approximation |
ESANN
2000
14 years 11 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...
JSCIC
2010
14 years 4 months ago
2010
We provide a priori error estimates for variational approximations of the ground state eigenvalue and eigenvector of nonlinear elliptic eigenvalue problems of the form -div(Au) + ...
FOCS
2010
IEEE
14 years 8 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:
308
click to vote
ICA
2012
Springer
13 years 5 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 ...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...