Sciweavers

1951 search results - page 43 / 391
» An algorithm for improving graph partitions
Sort
View
EVOW
2004
Springer
15 years 3 months ago
Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
Abraham Duarte, Ángel Sánchez, Felip...
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 8 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
MICCAI
2008
Springer
15 years 11 months ago
Weights and Topology: A Study of the Effects of Graph Construction on 3D Image Segmentation
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
Leo Grady, Marie-Pierre Jolly
IPPS
2002
IEEE
15 years 2 months ago
Optimizing Graph Algorithms for Improved Cache Performance
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
Joon-Sang Park, Michael Penner, Viktor K. Prasanna
AAIM
2007
Springer
127views Algorithms» more  AAIM 2007»
15 years 4 months ago
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
Zhi-Zhong Chen, Ruka Tanahashi