2657 search results - page 178 / 532 » On the complexity of hierarchical problem solving |
125
click to vote
PVLDB
2010
15 years 4 days ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
104
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
102
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
102
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
123
click to vote
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...