12 search results - page 2 / 3 » Randomness vs. Time: De-Randomization under a Uniform Assump... |
CC
2007
Springer
13 years 5 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
SIAMCOMP
2011
12 years 8 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
A new robust matching method is proposed. The Progressive Sample Consensus (PROSAC) algorithm exploits the linear ordering defined on the set of correspondences by a similarity fu...
SENSYS
2003
ACM
13 years 10 months ago
2003
ACM
Sensor networks often involve the monitoring of mobile phenomena. We believe this task can be facilitated by a spatiotemporal multicast protocol which we call “mobicast”. Mobi...