153 search results - page 13 / 31 » An Empirical Analysis of Approximation Algorithms for Euclid... |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
TSP
2010
13 years 2 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
SIGMETRICS
2010
ACM
14 years 9 days ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...