15 search results - page 2 / 3 » Ramsey numbers of sparse hypergraphs |
GC
2008
Springer
13 years 5 months ago
2008
Springer
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
PDP
2010
IEEE
13 years 11 months ago
2010
IEEE
Abstract—We investigate the scalability of the hypergraphbased sparse matrix partitioning methods with respect to the increasing sizes of matrices and number of nonzeros. We prop...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...