13603 search results - page 36 / 2721 » On the Complexity of Computing Treelength |
MFCS
2010
Springer
13 years 7 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...
TRIDENTCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract. This paper describes AutoNetkit, an auto-configuration tool for complex network emulations using Netkit, allowing large-scale networks to be tested on commodity hardware....
TOG
2002
13 years 8 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...
COMSIS
2010
13 years 6 months ago
2010
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...
JCST
2010
13 years 3 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...