1105 search results - page 102 / 221 » Linear choosability of graphs |
127
click to vote
ISAAC
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
143
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
134
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Systematic content screening of cell phenotypes in microscopic images has been shown promising in gene function understanding and drug design. However, manual annotation of cells ...
138
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
123
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...