Sciweavers

173 search results - page 14 / 35
» random 1999
Sort
View
EUROCRYPT
2001
Springer
14 years 2 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley
ISLPED
1999
ACM
47views Hardware» more  ISLPED 1999»
14 years 2 months ago
Databus charge recovery: practical considerations
The charge recovery databus is a scheme which reduces energy consumption through the application of adiabatic circuit techniques. Previous work 2 gives a solid theoretical analysi...
Benjamin Bishop, Mary Jane Irwin
FOCS
1999
IEEE
14 years 2 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 10 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
JCNS
2002
101views more  JCNS 2002»
13 years 9 months ago
Redundancy and Synergy Arising from Pairwise Correlations in Neuronal Ensembles
Multielectrode arrays allow recording of the activity of many single neurons, from which correlations can be calculated. The functional roles of correlations can be revealed by mea...
Michele Bezzi, Mathew E. Diamond, Alessandro Treve...