Sciweavers

1695 search results - page 44 / 339
» Linear, Polynomial or Exponential
Sort
View
111
Voted
GLOBECOM
2007
IEEE
15 years 7 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 6 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose
105
Voted
ICRA
1999
IEEE
75views Robotics» more  ICRA 1999»
15 years 5 months ago
Trap Design for Vibratory Bowl Feeders
The vibratory bowl feeder is the oldest and still most common approach to the automated feeding (orienting) of industrial parts. In this paper we consider a class of vibratory bow...
Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrenc...
90
Voted
COCO
2009
Springer
113views Algorithms» more  COCO 2009»
15 years 4 months ago
Extractors for Low-Weight Affine Sources
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
Anup Rao
99
Voted
COLT
2006
Springer
15 years 4 months ago
DNF Are Teachable in the Average Case
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
Homin K. Lee, Rocco A. Servedio, Andrew Wan