1998 search results - page 248 / 400 » Complexity of the Cover Polynomial |
102
click to vote
ICIAP
1999
ACM
15 years 5 months ago
1999
ACM
In this paper, we applied local warping techniques to construct a frame work of image-based morphing for facial expressions animation with low complexity. From the experience we o...
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
CAEPIA
2007
Springer
15 years 5 months ago
2007
Springer
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
COCO
2010
Springer
15 years 4 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...