62 search results - page 9 / 13 » Global minimum cuts in surface embedded graphs |
ML
2010
ACM
13 years 2 months ago
2010
ACM
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
SIAMCOMP
2010
13 years 5 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
CGA
2000
13 years 7 months ago
2000
Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of three-dimensional objects is one of...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...