1949 search results - page 205 / 390 » Random graphs on surfaces |
166
click to vote
JGAA
2007
15 years 4 months ago
2007
The task of finding the largest subset of vertices of a graph that induces a planar subgraph is known as the Maximum Induced Planar Subgraph problem (MIPS). In this paper, some n...
140
click to vote
ICIAP
2003
ACM
16 years 5 months ago
2003
ACM
Segmentation of 3D human body is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approach based on...
133
click to vote
WSDM
2009
ACM
15 years 12 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
140
click to vote
ECCV
2006
Springer
16 years 7 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...
139
click to vote
ICPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Shape skeleton extraction is a fundamental preprocessing task in shape-based pattern recognition. This paper presents a new algorithm for fast and precise extraction of kinematic ...