17 search results - page 3 / 4 » Planar Graphs, via Well-Orderly Maps and Trees |
ICIP
2005
IEEE
14 years 7 months ago
2005
IEEE
We present a technique for constructing a "clean" texture map of a partially occluded building facade from a series of images taken from a moving camera. Building region...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
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...
SODA
2007
ACM
13 years 6 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
NIPS
2007
13 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...