Sciweavers

83 search results - page 5 / 17
» Improved Cut Sequences for Partitioning Based Placement
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Graph-Cut Transducers for Relevance Feedback in Content Based Image Retrieval
Closing the semantic gap in content based image retrieval (CBIR) basically requires the knowledge of the user's intention which is usually translated into a sequence of quest...
Hichem Sahbi, Jean-Yves Audibert, Renaud Keriven
DAC
2005
ACM
13 years 10 months ago
Faster and better global placement by a new transportation algorithm
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
Ulrich Brenner, Markus Struzyna
AINA
2006
IEEE
14 years 2 months ago
Partitioned optimization algorithms for multiple sequence alignment
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
Yixin Chen, Yi Pan, Juan Chen, Wei Liu, Ling Chen
ICCAD
2002
IEEE
89views Hardware» more  ICCAD 2002»
14 years 1 months ago
Free space management for cut-based placement
IP blocks and large macro cells are increasingly prevalent in physical design, actually causing an increase in the available free space for the dust logic. We observe that top-dow...
Charles J. Alpert, Gi-Joon Nam, Paul Villarrubia
ARCS
2008
Springer
13 years 10 months ago
Topology-Aware Replica Placement in Fault-Tolerant Embedded Networks
Application details uncertain at design time as well as tolerance against permanent resource defects demand flexibility and redundancy. In this context, we present a strategy for p...
Thilo Streichert, Michael Glaß, Rolf Wanka, ...