6274 search results - page 598 / 1255 » From query complexity to computational complexity |
204
click to vote
ECAI
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
208
click to vote
SIGGRAPH
1995
ACM
15 years 10 months ago
1995
ACM
We are presenting techniques for simulating the motion and the deformation of cloth, fabrics or, more generally, deformable surfaces. Our main goal is to be able to simulate any k...
186
click to vote
CF
2005
ACM
15 years 9 months ago
2005
ACM
As microarchitectural and system complexity grows, comprehending system behavior becomes increasingly difficult, and often requires obtaining and sifting through voluminous event ...
215
click to vote
FSE
2008
Springer
15 years 8 months ago
2008
Springer
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
174
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...