2314 search results - page 196 / 463 » Minimal Partitions of a Graph |
174
click to vote
IWSOC
2003
IEEE
16 years 11 days 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...
153
Voted
GD
2009
Springer
15 years 11 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...
181
click to vote
SCALESPACE
2009
Springer
16 years 1 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...
177
click to vote
GECCO
2003
Springer
16 years 9 days 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...
193
click to vote
ECCV
2008
Springer
16 years 9 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...