Sciweavers

27 search results - page 6 / 6
» The Boolean Hierarchy and the Polynomial Hierarchy: a Closer...
Sort
View
LPAR
2004
Springer
14 years 24 days ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
IJCV
2007
179views more  IJCV 2007»
13 years 7 months ago
Global Detection of Salient Convex Boundaries
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
Song Wang, Joachim S. Stahl, Adam Bailey, Michael ...