2957 search results - page 303 / 592 » The Complexity of Polynomial-Time Approximation |
201
click to vote
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
192
click to vote
IJCNN
2006
IEEE
16 years 20 days ago
2006
IEEE
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
146
Voted
TIT
2010
15 years 1 months ago
2010
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
186
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
We analyze the least?squares error for structure from motion with a single infinitesimal motion ("structure from optical flow"). We present asymptotic approximations to ...
199
Voted
JBCB
2007
15 years 6 months ago
2007
Mechanistic models for transcriptional regulation are derived using the methods of equilibrium statistical mechanics, to model equilibrating processes that occur at a fast time sc...