15033 search results - page 398 / 3007 » Complexity Theory and Algorithms |
217
click to vote
UAI
2000
15 years 9 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
243
click to vote
TIP
2008
15 years 7 months ago
2008
This paper describes an approach to image modelling using interscale phase relationships of wavelet coefficients for use in image estimation applications. The method is based on th...
162
click to vote
AAECC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
209
click to vote
ALGORITHMICA
2002
15 years 7 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
221
click to vote
STOC
1989
ACM
15 years 11 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...