1736 search results - page 149 / 348 » The rank-width of Directed Graphs |
129
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
131
click to vote
AAAI
2008
15 years 7 months ago
2008
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
122
click to vote
KRDB
1998
15 years 6 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
149
click to vote
DAM
2010
15 years 4 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
154
click to vote
ICIP
2002
IEEE
16 years 6 months ago
2002
IEEE
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed algorithm does not need any a priori global shape model,...