3208 search results - page 232 / 642 » A Lower Bound for Primality |
166
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
175
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
156
click to vote
FOCS
2005
IEEE
16 years 6 days ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
177
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
156
click to vote
ALT
2002
Springer
16 years 3 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...