Sciweavers

1017 search results - page 135 / 204
» On the Computational Complexity of Sensor Network Localizati...
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
CCGRID
2010
IEEE
13 years 8 months ago
Streamflow Programming Model for Data Streaming in Scientific Workflows
Geo-sciences involve large-scale parallel models, high resolution real time data from highly asynchronous and heterogeneous sensor networks and instruments, and complex analysis a...
Chathura Herath, Beth Plale
IPSN
2007
Springer
14 years 1 months ago
The regiment macroprogramming system
The development of high-level programming environments is essential if wireless sensor networks are to be accessible to nonexperts. In this paper, we present the Regiment system, ...
Ryan Newton, Greg Morrisett, Matt Welsh
IPSN
2011
Springer
12 years 11 months ago
Localising speech, footsteps and other sounds using resource-constrained devices
While a number of acoustic localisation systems have been proposed over the last few decades, these have typically either relied on expensive dedicated microphone arrays and works...
Yukang Guo, Mike Hazas

Publication
453views
15 years 24 days ago
Analysis and Compensation of Rolling Shutter Effect
Due to the sequential-readout structure of complementary-metal-oxide semiconductor image sensor array, each scanline of the acquired image is exposed at a different time, resulting...
Chia-Kai Liang, Li-Wen Chang, Homer Chen