656 search results - page 8 / 132 » Large-Graph Layout Algorithms at Work: An Experimental Study |
80
Voted
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
JEA
2008
14 years 9 months ago
2008
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
MLMTA
2003
14 years 11 months ago
2003
— This work shows comparatively the capacity of five Fuzzy Lattice Neurocomputing (FLN) classifiers. The mechanics of the five classifiers are illustrated geometrically on the pl...
ICCAD
1997
IEEE
15 years 1 months ago
1997
IEEE
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monoton...