2520 search results - page 207 / 504 » The complexity of approximating entropy |
179
click to vote
LATIN
2010
Springer
15 years 4 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...
175
click to vote
IJCNN
2006
IEEE
15 years 12 months 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...
140
click to vote
TIT
2010
15 years 18 days 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...
151
click to vote
BIOADIT
2006
Springer
15 years 9 months ago
2006
Springer
Life-like adaptive behaviour is so far an illusive goal in robot control. A capability to act successfully in a complex, ambiguous, and harsh environment would vastly increase the ...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...