10988 search results - page 161 / 2198 » Algorithmic Folding Complexity |
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 ...
114
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
146
Voted
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
123
click to vote
ICCSA
2007
Springer
15 years 9 months ago
2007
Springer
Ubiquitous multimedia services are emerging to be available at anytime and anywhere using a variety of computing devices. In this paper, we propose a low-complexity unequal loss pr...
161
click to vote
VISUALIZATION
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents a novel algorithm combining view-dependent rendering and conservative occlusion culling for interactive display of complex environments. A vertex hierarchy of ...