212 search results - page 41 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
DAM
2007
13 years 5 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
STOC
2005
ACM
14 years 6 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...