11565 search results - page 147 / 2313 » Computing Minimal Mappings |
135
Voted
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
130
click to vote
GLVLSI
2003
IEEE
15 years 9 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
122
click to vote
CVPR
1997
IEEE
15 years 8 months ago
1997
IEEE
— A number of active contour models have been proposed that unify the curve evolution framework with classical energy minimization techniques for segmentation, such as snakes. Th...
117
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
104
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...