Sciweavers

43 search results - page 1 / 9
» Sorting by Placement and Shift
Sort
View
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 5 months ago
Sorting by Placement and Shift
Sergi Elizalde, Peter Winkler
ITIIS
2010
183views more  ITIIS 2010»
13 years 3 months ago
Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting
To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embed...
Hee Joon Hwang, Hyoung Joong Kim, Vasiliy Sachnev,...
IPPS
2005
IEEE
13 years 10 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
ICCAD
2009
IEEE
125views Hardware» more  ICCAD 2009»
13 years 2 months ago
CROP: Fast and effective congestion refinement of placement
Modern circuits become harder to route with the ever decreasing design features. Previous routability-driven placement techniques are usually tightly coupled with the underlying p...
Yanheng Zhang, Chris Chu
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
13 years 8 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...