Sciweavers

83 search results - page 3 / 17
» Improved Cut Sequences for Partitioning Based Placement
Sort
View
ACCV
2009
Springer
14 years 12 days ago
Iterated Graph Cuts for Image Segmentation
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
Bo Peng, Lei Zhang, Jian Yang
DEXA
2010
Springer
156views Database» more  DEXA 2010»
13 years 6 months ago
Improving Alternative Text Clustering Quality in the Avoiding Bias Task with Spectral and Flat Partition Algorithms
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...
M. Eduardo Ares, Javier Parapar, Alvaro Barreiro
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
13 years 10 months ago
Improving Placement under the Constant Delay Model
In this paper, we show that under the constant delay model the placement problem is equivalent to minimizing a weighted sum of wire lengths. The weights can be efficiently compute...
Kolja Sulimma, Wolfgang Kunz, Ingmar Neumann, Luka...
DAC
2004
ACM
14 years 6 months ago
Placement feedback: a concept and method for better min-cut placements
The advent of strong multi-level partitioners has made topdown min-cut placers a favored choice for modern placer implementations. We examine terminal propagation, an important st...
Andrew B. Kahng, Sherief Reda
ISPD
1999
ACM
85views Hardware» more  ISPD 1999»
13 years 10 months ago
Optimal partitioners and end-case placers for standard-cell layout
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...