2463 search results - page 227 / 493 » Rankings of Directed Graphs |
127
click to vote
ICALP
2010
Springer
15 years 8 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...
128
click to vote
AAAI
2008
15 years 6 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 ...
116
click to vote
KRDB
1998
15 years 5 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...
145
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...
136
click to vote
CVPR
2011
IEEE
15 years 7 days ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...