2314 search results - page 90 / 463 » Minimal Partitions of a Graph |
112
Voted
ICIP
2007
IEEE
16 years 5 months ago
2007
IEEE
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image si...
114
Voted
ICCD
2006
IEEE
16 years 14 days ago
2006
IEEE
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
122
click to vote
PAMI
2006
15 years 3 months ago
2006
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...
123
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
113
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...