28 search results - page 3 / 6 » Local Graph Partitions for Approximation and Testing |
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
ECCV
2008
Springer
14 years 5 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
IEEECIT
2009
IEEE
14 years 1 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
HIS
2009
13 years 4 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...