263 search results - page 40 / 53 » Combinatorial Shape Decomposition |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
107
click to vote
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
SIAMCOMP
2010
14 years 6 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
ICDAR
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents a new framework for in-depth analysis of the performance of layout analysis methods. Contrary to existing approaches aimed at evaluation or benchmarking, the p...
CAIP
2007
Springer
15 years 5 months ago
2007
Springer
We propose a dominant-feature based matching method for capturing a target in a video sequence through the dynamic decomposition of the target template. The target template is segm...