1149 search results - page 43 / 230 » Minimally non-Pfaffian graphs |
105
click to vote
APVIS
2008
15 years 1 months ago
2008
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number problem of traditional graphs. We discuss differences to the traditional crossin...
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
114
click to vote
LCPC
2009
Springer
15 years 4 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
EUROGRAPHICS
2010
Eurographics
15 years 9 months ago
2010
Eurographics
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
111
click to vote
AUSAI
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...