Sciweavers

2705 search results - page 50 / 541
» Splitting the sensor node
Sort
View
173
Voted
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 9 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
98
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Tracking with Unreliable Node Sequences
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
Ziguo Zhong, Ting Zhu, Dan Wang, Tian He
140
Voted
CC
1998
Springer
111views System Software» more  CC 1998»
15 years 2 months ago
Live Range Splitting in a Graph Coloring Register Allocator
Graph coloring is the dominant paradigm for global register allocation [8, 7, 4]. Coloring allocators use an interference graph, Z, to model conflicts that prevent two values from ...
Keith D. Cooper, L. Taylor Simpson
142
Voted
MOBICOM
2009
ACM
15 years 9 months ago
Interference management via rate splitting and HARQ over time-varying fading channels
The coexistence of two unlicensed links is considered, where one link interferes with the transmission of the other, over a timevarying, block-fading channel. In the absence of fa...
Marco Levorato, Osvaldo Simeone, Urbashi Mitra
CODES
2007
IEEE
15 years 9 months ago
On the impact of manufacturing process variations on the lifetime of sensor networks
As an emerging technology, sensor networks provide the ability to accurately monitor the characteristics of wide geographical areas over long periods of time. The lifetime of indi...
Siddharth Garg, Diana Marculescu