Sciweavers

739 search results - page 93 / 148
» Sorting Algorithms
Sort
View
GECCO
2008
Springer
111views Optimization» more  GECCO 2008»
13 years 8 months ago
Single-objective front optimization: application to rf circuit design
This paper proposes a new algorithm which promotes well distributed non-dominated fronts in the parameters space when a single-objective function is optimized. This algorithm is b...
Eduardo José Solteiro Pires, Luís Me...
SIGARCH
2008
94views more  SIGARCH 2008»
13 years 7 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
VLDB
2007
ACM
117views Database» more  VLDB 2007»
14 years 7 months ago
RadixZip: Linear-Time Compression of Token Streams
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
Binh Vo, Gurmeet Singh Manku
BMCBI
2010
97views more  BMCBI 2010»
13 years 7 months ago
Biomarker discovery in heterogeneous tissue samples -taking the in-silico deconfounding approach
Background: For heterogeneous tissues, such as blood, measurements of gene expression are confounded by relative proportions of cell types involved. Conclusions have to rely on es...
Dirk Repsilber, Sabine Kern, Anna Telaar, Gerhard ...
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
14 years 1 months ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez