2262 search results - page 342 / 453 » Points with large quadrant-depth |
183
click to vote
ANTS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
236
click to vote
EUROCRYPT
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
177
click to vote
STACS
1999
Springer
15 years 10 months ago
1999
Springer
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
169
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
170
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...