Sciweavers

385 search results - page 21 / 77
» Contour Approximation in Sensor Networks
Sort
View
DMSN
2010
ACM
14 years 10 months ago
PAO: power-efficient attribution of outliers in wireless sensor networks
Sensor nodes constitute inexpensive, disposable devices that are often scattered in harsh environments of interest so as to collect and communicate desired measurements of monitor...
Nikos Giatrakos, Yannis Kotidis, Antonios Deligian...
MSN
2005
Springer
15 years 3 months ago
Population Estimation for Resource Inventory Applications over Sensor Networks
Abstract. The growing advance in wireless communications and electronics makes the development of low-cost and low-power sensors possible. These sensors are usually small in size a...
Jiun-Long Huang
85
Voted
INFOCOM
2007
IEEE
15 years 3 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
TNN
2008
119views more  TNN 2008»
14 years 9 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
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...