Sciweavers

162 search results - page 30 / 33
» Study of Lower Bound Functions for MAX-2-SAT
Sort
View
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
15 years 3 months ago
Dimension, Entropy Rates, and Compression
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
John M. Hitchcock, N. V. Vinodchandran
COMPGEOM
2004
ACM
15 years 3 months ago
On locally Delaunay geometric graphs
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Rom Pinchasi, Shakhar Smorodinsky
CORR
2010
Springer
204views Education» more  CORR 2010»
14 years 9 months ago
Limited Feedback Multi-Antenna Quantization Codebook Design-Part II: Multiuser Channels
This is the second part of a two-part paper on optimal design of limited feedback single-user and multiuser spatial multiplexing systems. The first part of the paper studies the si...
Behrouz Khoshnevis, Wei Yu
FOCS
2010
IEEE
14 years 7 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
ICALP
2004
Springer
15 years 3 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee