Sciweavers

2767 search results - page 231 / 554
» Universal Exponentiation Algorithm
Sort
View
134
Voted
UAI
2000
15 years 3 months ago
The Complexity of Decentralized Control of Markov Decision Processes
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...
Daniel S. Bernstein, Shlomo Zilberstein, Neil Imme...
ICASSP
2010
IEEE
15 years 2 months ago
Hierarchical Gaussian Mixture Model
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
Vincent Garcia, Frank Nielsen, Richard Nock
117
Voted
TKDE
2008
128views more  TKDE 2008»
15 years 2 months ago
Mixed-Drove Spatiotemporal Co-Occurrence Pattern Mining
Mixed-drove spatiotemporal co-occurrence patterns (MDCOPs) represent subsets of two or more different object-types whose instances are often located in spatial and temporal proximi...
Mete Celik, Shashi Shekhar, James P. Rogers, James...
95
Voted
TSP
2008
102views more  TSP 2008»
15 years 2 months ago
Spatially Adaptive Estimation via Fitted Local Likelihood Techniques
Abstract--This paper offers a new technique for spatially adaptive estimation. The local likelihood is exploited for nonparametric modeling of observations and estimated signals. T...
Vladimir Katkovnik, Vladimir Spokoiny
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
15 years 2 months ago
Sharp Quantum versus Classical Query Complexity Separations
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...
J. Niel de Beaudrap, Richard Cleve, John Watrous