4539 search results - page 109 / 908 » Approaches to Compute Workflow Complexity |
TOG
2002
14 years 9 months ago
2002
In this paper we present a general method for rapid prototyping of realistic character motion. We solve for the natural motion from a simple animation provided by the animator. Ou...
JCST
2010
14 years 4 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
103
click to vote
CSR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
CVPR
2007
IEEE
15 years 12 months ago
2007
IEEE
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
JMLR
2006
14 years 10 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...