Sciweavers

1369 search results - page 100 / 274
» Lattice computations for random numbers
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 9 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
SAC
2008
ACM
13 years 8 months ago
A biologically inspired generation of virtual characters
A number of techniques for generating geometric models of human head and body are in use nowadays. Models of human characters are useful in computer games, virtual reality, and ma...
Roberto C. Cavalcante Vieira, Creto Augusto Vidal,...
STACS
2009
Springer
14 years 1 months ago
Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Mahdi Cheraghchi, Amin Shokrollahi
IJISEC
2002
58views more  IJISEC 2002»
13 years 8 months ago
A complete characterization of a family of key exchange protocols
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
ICIP
2000
IEEE
14 years 10 months ago
Low Complexity Cut Detection in the Presence of Flicker
This paper deals with techniques to detect abrupt scene transitions when random brightness variations (flicker) are present. This is normally the case when trying to restore or in...
Antonio Albiol, Valery Naranjo, Jesús Angul...