Sciweavers

14699 search results - page 363 / 2940
» Complexity and Cognitive Computing
Sort
View
JMLR
2006
117views more  JMLR 2006»
15 years 4 months ago
On the Complexity of Learning Lexicographic Strategies
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...
Michael Schmitt, Laura Martignon
TOG
2002
98views more  TOG 2002»
15 years 4 months ago
Synthesis of complex dynamic character motion from simple animations
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...
C. Karen Liu, Zoran Popovic
COMSIS
2010
15 years 2 months ago
Multi-video summarization using complex graph clustering and mining
Multi-video summarization is a great theoretical and technical challenge due to the wider diversity of topics in multi-video than singlevideo as well as the multi-modality nature o...
Jian Shao, Dongming Jiang, Mengru Wang, Hong Chen,...
JCST
2010
189views more  JCST 2010»
14 years 11 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
CSR
2011
Springer
14 years 8 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov