Sciweavers

1480 search results - page 112 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
DCOSS
2005
Springer
14 years 4 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
IJCAI
2007
14 years 6 days ago
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
IJSNET
2007
95views more  IJSNET 2007»
13 years 10 months ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 11 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
CLEAR
2006
Springer
133views Biometrics» more  CLEAR 2006»
14 years 2 months ago
Multi-feature Graph-Based Object Tracking
We present an object detection and tracking algorithm that addresses the problem of multiple simultaneous targets tracking in realworld surveillance scenarios. The algorithm is bas...
Murtaza Taj, Emilio Maggio, Andrea Cavallaro