Sciweavers

1221 search results - page 196 / 245
» Balanced graph partitioning
Sort
View
PAMI
2007
122views more  PAMI 2007»
13 years 7 months ago
Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
Anupama Jagannathan, Eric L. Miller
MICCAI
2010
Springer
13 years 6 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu
DM
2010
124views more  DM 2010»
13 years 5 months ago
Perfect dodecagon quadrangle systems
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
Lucia Gionfriddo, Mario Gionfriddo
CORR
2011
Springer
208views Education» more  CORR 2011»
13 years 2 months ago
GRASP and path-relinking for Coalition Structure Generation
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
DM
2010
99views more  DM 2010»
13 years 2 months ago
Perfect octagon quadrangle systems
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
Luigia Berardi, Mario Gionfriddo, Rosaria Rota