13603 search results - page 25 / 2721 » On the Complexity of Computing Treelength |
COMSIS
2010
13 years 5 months ago
2010
We present a novel method to robustly and efficiently detect moving object, even under the complexity background, such as illumination changes, long shadows etc. This work is disti...
ACL
2011
13 years 20 days ago
2011
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
GC
2011
Springer
13 years 15 days ago
2011
Springer
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
TOG
2002
13 years 8 months ago
2002
This paper describes a new framework for video matting, the process of pulling a high-quality alpha matte and foreground from a video sequence. The framework builds upon technique...
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...