10608 search results - page 209 / 2122 » Complexity of O'Hara's Algorithm |
CORR
1998
Springer
13 years 10 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
TCOM
2010
13 years 9 months ago
2010
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
CVPR
2008
IEEE
15 years 24 days ago
2008
IEEE
This article addresses the problem of real-time visual tracking in presence of complex motion blur. Previous authors have observed that efficient tracking can be obtained by match...
ICIP
2006
IEEE
15 years 13 days ago
2006
IEEE
The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth...
EDBT
2008
ACM
14 years 11 months ago
2008
ACM
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...