1369 search results - page 76 / 274 » Lattice computations for random numbers |
COCO
1991
Springer
14 years 14 days ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
PERCOM
2009
ACM
14 years 3 months ago
2009
ACM
—Privacy protection is increasingly important during authentications in Radio Frequency Identification (RFID) systems. In order to achieve high-speed authentication in largescale...
APPROX
2006
Springer
14 years 21 days ago
2006
Springer
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
Recently, a new exemplar-based method for image completion, texture synthesis and image inpainting was proposed which uses a discrete global optimization strategy based on Markov ...