2661 search results - page 126 / 533 » Quantum Complexity Classes |
117
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
134
Voted
IJCAI
2001
15 years 4 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
151
Voted
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
156
click to vote
TIT
2010
14 years 10 months ago
2010
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
120
Voted
PODS
2007
ACM
16 years 3 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...