Sciweavers

193 search results - page 38 / 39
» Algorithmic Information Theory and Cellular Automata Dynamic...
Sort
View
JCIT
2008
138views more  JCIT 2008»
14 years 9 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
MOBIHOC
2009
ACM
15 years 10 months ago
Fault tolerant target tracking in sensor networks
In this paper, we present a Gaussian mixture model based approach to capture the spatial characteristics of any target signal in a sensor network, and further propose a temporally...
Min Ding, Xiuzhen Cheng
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
15 years 9 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
SIGMETRICS
2009
ACM
182views Hardware» more  SIGMETRICS 2009»
15 years 4 months ago
The age of gossip: spatial mean field regime
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
Augustin Chaintreau, Jean-Yves Le Boudec, Nikodin ...
90
Voted
CASES
2006
ACM
15 years 3 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson