Sciweavers

399 search results - page 77 / 80
» Robust Boosting for Learning from Few Examples
Sort
View
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
14 years 9 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 2 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
SCAI
1993
13 years 9 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt
BMCBI
2005
161views more  BMCBI 2005»
13 years 8 months ago
Non-linear mapping for exploratory data analysis in functional genomics
Background: Several supervised and unsupervised learning tools are available to classify functional genomics data. However, relatively less attention has been given to exploratory...
Francisco Azuaje, Haiying Wang, Alban Chesneau
EUROCRYPT
2003
Springer
14 years 1 months ago
Facts and Myths of Enigma: Breaking Stereotypes
In spite of a relatively large number of publications about breaking Enigma by the Allies before and during the World War II, this subject remains relatively unknown not only to th...
Kris Gaj, Arkadiusz Orlowski