605 search results - page 63 / 121 » Constrained Graph Layout |
CVPR
2007
IEEE
14 years 4 months ago
2007
IEEE
A successful representation of objects in the literature is as a collection of patches, or parts, with a certain appearance and position. The relative locations of the different p...
ICPR
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
GD
1998
Springer
14 years 2 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
JGAA
2000
13 years 9 months ago
2000
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...