Sciweavers

52 search results - page 11 / 11
» On the computational complexity of strong edge coloring
Sort
View
ICCV
2007
IEEE
14 years 6 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
ICIP
2003
IEEE
14 years 6 months ago
An adaptive multigrid algorithm for region of interest diffuse optical tomography
Dueto diffuse nature of lightphotons, Diffuse Optical Tomography (DOT) image reconstruction is a challenging 3D problem with a relatively large number of unknowns and limited meas...
Murat Guven, Birsen Yazici, Xavier Intes, Britton ...