Sciweavers

441 search results - page 25 / 89
» Optimal Subsequence Bijection
Sort
View
CORR
2002
Springer
78views Education» more  CORR 2002»
15 years 5 months ago
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 11 months ago
Multi-chromosomal genetic programming
This paper introduces an evolutionary algorithm which uses multiple chromosomes to evolve solutions to a symbolic regression problem. Inspiration for this algorithm is provided by...
Rachel Cavill, Stephen L. Smith, Andrew M. Tyrrell
CHES
2000
Springer
204views Cryptology» more  CHES 2000»
15 years 10 months ago
Using Second-Order Power Analysis to Attack DPA Resistant Software
Under a simple power leakage model based on Hamming weight, a software implementation of a data-whitening routine is shown to be vulnerable to a first-order Differential Power Anal...
Thomas S. Messerges
JGO
2008
90views more  JGO 2008»
15 years 5 months ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
PLDI
2010
ACM
15 years 10 months ago
Evaluating Iterative Optimization across 1000 Data Sets
While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the b...
Yang Chen, Yuanjie Huang, Lieven Eeckhout, Grigori...