Sciweavers

1089 search results - page 143 / 218
» Randomness and Reducibility
Sort
View
SAMOS
2007
Springer
14 years 4 months ago
k  +   Neigh : An Energy Efficient Topology Control for Wireless Sensor Networks
For most applications in wireless sensor networks (WSNs), it is often assumed that the deployment of sensor nodes is unmanaged and random, so the density of local node may vary thr...
Dong-Min Son, Young-Bae Ko
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 4 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
COMSWARE
2006
IEEE
14 years 4 months ago
Exploiting multi-channel clustering for power efficiency in sensor networks
Sensor networks typically comprise of a number of inexpensive small devices with processing, communication and sensing abilities that collaborate to perform a common task. Sensor d...
Ashima Gupta, Chao Gui, Prasant Mohapatra
ICPPW
2006
IEEE
14 years 4 months ago
Parallel Implementation of the Polyhedral Homotopy Method
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
Jan Verschelde, Yan Zhuang
ICRA
2006
IEEE
104views Robotics» more  ICRA 2006»
14 years 4 months ago
Range-only SLAM for Robots Operating Cooperatively with Sensor Networks
— A mobile robot we have developed is equipped with sensors to measure range to landmarks and can simultaneously localize itself as well as locate the landmarks. This modality is...
Joseph Djugash, Sanjiv Singh, George Kantor, Wei Z...