Sciweavers

2168 search results - page 375 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
MOBIHOC
2004
ACM
16 years 3 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
145
Voted
PODC
2009
ACM
16 years 23 days ago
Memory models: a case for rethinking parallel languages and hardware
The era of parallel computing for the masses is here, but writing correct parallel programs remains far more difficult than writing sequential programs. Aside from a few domains,...
Sarita V. Adve
SASN
2005
ACM
15 years 9 months ago
Key distribution and update for secure inter-group multicast communication
Group communication has become an important component in wireless networks. In this paper, we focus on the environments in which multiple groups coexist in the system, and both in...
Weichao Wang, Bharat K. Bhargava
149
Voted
MM
2004
ACM
212views Multimedia» more  MM 2004»
15 years 9 months ago
Nonparametric motion model
Motion information is a powerful cue for visual perception. In the context of video indexing and retrieval, motion content serves as a useful source for compact video representati...
Ling-Yu Duan, Min Xu, Qi Tian, Changsheng Xu
135
Voted
PERVASIVE
2008
Springer
15 years 3 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...