4894 search results - page 321 / 979 » The Guarding Problem - Complexity and Approximation |
150
click to vote
ICRA
2008
IEEE
16 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 ...
186
click to vote
VLDB
2004
ACM
16 years 23 hour ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
216
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
206
click to vote
ICA
2010
Springer
15 years 7 months ago
2010
Springer
Two-photon calcium imaging is an emerging experimental technique that enables the study of information processing within neural circuits in vivo. While the spatial resolution of th...
194
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...