2107 search results - page 28 / 422 » Computing Small Search Numbers in Linear Time |
160
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
141
click to vote
CATS
2007
15 years 7 months ago
2007
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
197
click to vote
IMA
2009
Springer
16 years 13 days ago
2009
Springer
Cache timing attacks are a class of side-channel attacks that is applicable against certain software implementations. They have generated significant interest when demonstrated ag...
142
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
174
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...