Sciweavers

74 search results - page 12 / 15
» The communication complexity of the Hamming distance problem
Sort
View
IPSN
2007
Springer
14 years 1 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
IPPS
2009
IEEE
14 years 2 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
PODC
2003
ACM
14 years 27 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
DSD
2002
IEEE
96views Hardware» more  DSD 2002»
14 years 18 days ago
Networks on Silicon: Blessing or Nightmare?
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
Paul Wielage, Kees G. W. Goossens
CN
2002
82views more  CN 2002»
13 years 7 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer