2314 search results - page 124 / 463 » Minimal Partitions of a Graph |
129
click to vote
DATE
2006
IEEE
15 years 9 months ago
2006
IEEE
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...
140
click to vote
DAC
1995
ACM
15 years 7 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
122
click to vote
APCSAC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
146
click to vote
JMLR
2006
15 years 3 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
147
click to vote
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
Due to the presence of speckle, segmentation of SAR images is generally acknowledged as a difficult problem. A large effort has been done in order to cope with the influence of sp...