209 search results - page 16 / 42 » The Computational Complexity of Weak Saddles |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Two major challenges in collaborative filtering are the efficiency of the algorithms and the quality of the recommendations. A variety of machine learning methods have been applie...
WOLLIC
2010
Springer
14 years 16 days ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...