231 search results - page 23 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
COCO
2010
Springer
13 years 11 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
ASIACRYPT
2000
Springer
13 years 12 months ago
2000
Springer
A discrete-logarithm algorithm is called generic if it does not exploit the specific representation of the cyclic group for which it is supposed to compute discrete logarithms. Su...
DIS
2007
Springer
14 years 1 months ago
2007
Springer
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
MST
2010
13 years 2 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
SIAMSC
2008
13 years 7 months ago
2008
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...