325 search results - page 3 / 65 » Remarks on the Schoof-Elkies-Atkin algorithm |
TIT
2008
13 years 6 months ago
2008
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Numerous research studies have been investigated on proxy signatures over the last decade. This survey reviews the research progress on proxy signatures, analyzes a few notable pr...
ORL
2008
13 years 6 months ago
2008
We report a remarkable success of nested pricing rules over major pivot rules commonly used in practice, such as Dantzig's original rule as well as the steepest-edge rule and ...
MPC
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We present an algorithm for inverse computation in a rstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) i...
CJ
2010
13 years 6 months ago
2010
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...