Sciweavers

2385 search results - page 228 / 477
» Sense of Direction in Distributed Computing
Sort
View
FOCS
2007
IEEE
14 years 5 months ago
Polylogarithmic Independence Can Fool DNF Formulas
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
Louay Bazzi
VECPAR
2004
Springer
14 years 4 months ago
Data Management in Large-Scale P2P Systems
Peer-to-peer (P2P) computing offers new opportunities for building highly distributed data systems. Unlike client-server computing, P2P can operate without central coordination and...
Patrick Valduriez, Esther Pacitti
INFOCOM
2010
IEEE
13 years 9 months ago
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
Swaminathan Sankararaman, Alon Efrat, Srinivasan R...
ICDCS
2010
IEEE
13 years 11 months ago
Link-Centric Probabilistic Coverage Model for Transceiver-Free Object Detection in Wireless Networks
Abstract--Sensing coverage is essential for most applications in wireless networks. In traditional coverage problem study, the disk coverage model has been widely applied because o...
Dian Zhang, Yunhuai Liu, Lionel M. Ni
SPAA
2009
ACM
14 years 11 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...