Sciweavers

208 search results - page 17 / 42
» Parallel Algorithms for Computing Temporal Aggregates
Sort
View
DCOSS
2005
Springer
14 years 1 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
HPDC
2005
IEEE
14 years 1 months ago
Adaptive data block scheduling for parallel TCP streams
Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. W...
Thomas J. Hacker, Brian D. Noble, Brian D. Athey
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
CVPR
2007
IEEE
14 years 9 months ago
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
Benjamin Laxton, Jongwoo Lim, David J. Kriegman
DCOSS
2008
Springer
13 years 9 months ago
Multi-root, Multi-Query Processing in Sensor Networks
Sensor networks can be viewed as large distributed databases, and SQL-like high-level declarative languages can be used for data and information retrieval. Energy constraints make ...
Zhiguo Zhang, Ajay D. Kshemkalyani, Sol M. Shatz