231 search results - page 31 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— We present a new algorithm for routing of messages in ad-hoc networks where the nodes are energy-constrained. The routing objective is to maximize the total number of messages ...
EUROCRYPT
1999
Springer
13 years 11 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...
STOC
2010
ACM
14 years 12 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
TCS
2010
13 years 5 months ago
2010
We consider the problem of actively learning the mean values of distributions associated with a finite number of options. The decision maker can select which option to generate t...