2778 search results - page 25 / 556 » Limit complexities revisited |
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The high volume of packets and packet rates of traffic on some router links makes it exceedingly difficult for routers to examine every packet in order to keep detailed statistics ...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
SIGCOMM
2006
ACM
15 years 3 months ago
2006
ACM
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
JIDM
2010
14 years 8 months ago
2010
Preserving the privacy of individuals when data are shared for clustering is a complex problem. The challenge is how to protect the underlying data values subjected to clustering w...