501 search results - page 46 / 101 » Communication Lower Bounds Using Dual Polynomials |
VTC
2007
IEEE
14 years 3 months ago
2007
IEEE
— Placing relays around the base station (BS) to assist wireless communication is an effective way of extending coverage in cellular systems. This paper provides a quantitative a...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
STOC
2010
ACM
14 years 6 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...