412 search results - page 19 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
IPSN
2005
Springer
15 years 5 months ago
2005
Springer
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
ICDIM
2008
IEEE
15 years 6 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
AAAI
2007
15 years 2 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...