724 search results - page 8 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
83
Voted
DAC
2009
ACM
16 years 19 days ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
115
Voted
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We present a novel algorithm for performing integrated segmentation and 3D pose estimation of a human body from multiple views. Unlike other related state of the art tech...
JPDC
2006
14 years 11 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
GECCO
2000
Springer
15 years 3 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
257
click to vote
PAMI
2010
14 years 10 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...