Sciweavers

370 search results - page 43 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
SENSYS
2004
ACM
15 years 3 months ago
Medians and beyond: new aggregation techniques for sensor networks
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divya...
WINET
2011
14 years 4 months ago
Sleep scheduling with expected common coverage in wireless sensor networks
Sleep scheduling, which is putting some sensor nodes into sleep mode without harming network functionality, is a common method to reduce energy consumption in dense wireless sensor...
Eyuphan Bulut, Ibrahim Korpeoglu
MOBICOM
2009
ACM
15 years 4 months ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin
JCP
2008
121views more  JCP 2008»
14 years 9 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 10 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor