Sciweavers

500 search results - page 9 / 100
» Quantum computing: beyond the limits of conventional computa...
Sort
View
FUIN
1998
122views more  FUIN 1998»
13 years 7 months ago
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
The theory of evolutionary computation has been enhanced rapidly during the last decade. This survey is the attempt to summarize the results regarding the limit and nite time behav...
Günter Rudolph
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
14 years 1 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
ICPR
2008
IEEE
14 years 8 months ago
Beyond SVD: Sparse projections onto exemplar orthonormal bases for compact image representation
We present a new method for compact representation of large image datasets. Our method is based on treating small patches from an image as matrices as opposed to the conventional ...
Ajit Rajwade, Anand Rangarajan, Arunava Banerjee, ...
TEC
2002
101views more  TEC 2002»
13 years 7 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim
AC
1998
Springer
13 years 11 months ago
The Search for the Holy Grail in Quantum Cryptography
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...
Louis Salvail