Sciweavers

18306 search results - page 303 / 3662
» Algorithmics in Exponential Time
Sort
View
COLT
2005
Springer
16 years 9 days ago
Analysis of Perceptron-Based Active Learning
We start by showing that in an active learning setting, the Perceptron algorithm needs Ω( 1 ε2 ) labels to learn linear separators within generalization error ε. We then prese...
Sanjoy Dasgupta, Adam Tauman Kalai, Claire Montele...
ASIACRYPT
2000
Springer
15 years 11 months ago
A Note on Security Proofs in the Generic Model
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
Marc Fischlin
NIPS
2007
15 years 8 months ago
One-Pass Boosting
This paper studies boosting algorithms that make a single pass over a set of base classifiers. We first analyze a one-pass algorithm in the setting of boosting with diverse base...
Zafer Barutçuoglu, Philip M. Long, Rocco A....
ICCAD
2006
IEEE
183views Hardware» more  ICCAD 2006»
16 years 3 months ago
Soft error derating computation in sequential circuits
Soft error tolerant design becomes more crucial due to exponential increase in the vulnerability of computer systems to soft errors. Accurate estimation of soft error rate (SER), ...
Hossein Asadi, Mehdi Baradaran Tahoori
ACISP
2007
Springer
16 years 28 days ago
TCHo: A Hardware-Oriented Trapdoor Cipher
This paper improves the Finiasz-Vaudenay construction of TCHo, a hardware-oriented public-key cryptosystem, whose security relies on the hardness of finding a low-weight multiple ...
Jean-Philippe Aumasson, Matthieu Finiasz, Willi Me...