9611 search results - page 232 / 1923 » A Note on Difference Sets |
166
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
146
click to vote
CHI
2002
ACM
16 years 7 months ago
2002
ACM
This two-day workshop examines the ways that on-line communities create and refine their shared resources, including both the formal and observable artifacts (documents, chats, th...
192
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
176
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
176
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...