2314 search results - page 196 / 463 » Minimal Partitions of a Graph |
111
Voted
IWSOC
2003
IEEE
15 years 9 months ago
2003
IEEE
The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation method to extra...
109
click to vote
GD
2009
Springer
15 years 8 months ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
134
Voted
SCALESPACE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we suggest an algorithm to recover an image whose wavelet coefficients are partially lost. We propose a wavelet inpainting model by using L0-norm and the t...
121
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
149
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...