Sciweavers

3227 search results - page 595 / 646
» Designing with Distance Fields
Sort
View
IPSN
2007
Springer
16 years 23 days ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
MFCS
2007
Springer
16 years 23 days ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
INFOCOM
2006
IEEE
16 years 20 days ago
Tunnel Vector: A New Routing Algorithm with Scalability
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
Cheng-Jia Lai, Richard R. Muntz
MICRO
2006
IEEE
144views Hardware» more  MICRO 2006»
16 years 19 days ago
Die Stacking (3D) Microarchitecture
3D die stacking is an exciting new technology that increases transistor density by vertically integrating two or more die with a dense, high-speed interface. The result of 3D die ...
Bryan Black, Murali Annavaram, Ned Brekelbaum, Joh...
CONEXT
2006
ACM
16 years 18 days ago
Migrating home agents towards internet-scale mobility deployments
While the IETF standardization process of the Mobile IPv6 and Network Mobility (NEMO) protocols is almost complete, their large-scale deployment is not yet possible. With these te...
Ryuji Wakikawa, Guillaume Valadon, Jun Murai