Sciweavers

370 search results - page 53 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
TNN
1998
111views more  TNN 1998»
13 years 10 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
NETWORKING
2007
14 years 8 days ago
Location-Unaware Sensing Range Assignment in Sensor Networks
We study field-monitoring applications in which sensors are deployed in large numbers and the sensing process is expensive. In such applications, nodes should use the minimum poss...
Ossama Younis, Srinivasan Ramasubramanian, Marwan ...
ICASSP
2011
IEEE
13 years 2 months ago
RSS-based sensor localization with unknown transmit power
Received signal strength (RSS)-based single source localization when there is not a prior knowledge about the transmit power of the source is investigated. Because of nonconvex be...
Reza M. Vaghefi, Mohammad Reza Gholami, Erik G. St...
VLDB
2007
ACM
131views Database» more  VLDB 2007»
14 years 11 months ago
Dissemination of compressed historical information in sensor networks
Sensor nodes are small devices that "measure" their environment and communicate feeds of low-level data values to a base station for further processing and archiving. Dis...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
IJWMC
2010
115views more  IJWMC 2010»
13 years 8 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James