Sciweavers

539 search results - page 98 / 108
» Reliable Hierarchical Data Storage in Sensor Networks
Sort
View
SENSYS
2003
ACM
14 years 26 days ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
CIKM
2004
Springer
14 years 1 months ago
A practical web-based approach to generating topic hierarchy for text segments
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...
Shui-Lung Chuang, Lee-Feng Chien
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
A Low-delay Protocol for Multihop Wireless Body Area Networks
—Wireless Body Area Networks (WBANs) form a new and interesting area in the world of remote health monitoring. An important concern in such networks is the communication between ...
Benoît Latré, Bart Braem, Ingrid Moer...
INFOSCALE
2006
ACM
14 years 1 months ago
Simulating non-scanning worms on peer-to-peer networks
Millions of Internet users are using large-scale peerto-peer (P2P) networks to share content files today. Many other mission-critical applications, such as Internet telephony and...
Guanling Chen, Robert S. Gray