357 search results - page 36 / 72 » Fast Hypergraph Partition |
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
A new paradigm is introduced for floorplanning any combination of fixed-shape and variable-shape blocks under tight fixedoutline area constraints and a wirelength objective. Dra...
VLSM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
ICCSA
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
DAC
2003
ACM
14 years 24 days ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
INFOCOM
2002
IEEE
14 years 14 days ago
2002
IEEE
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...