Sciweavers

1710 search results - page 41 / 342
» Parallelism in Structured Newton Computations
Sort
View
IPPS
2002
IEEE
14 years 1 months ago
A Performance Optimization Framework for Compilation of Tensor Contraction Expressions into Parallel Programs
This paper discusses a program synthesis system to facilitate the generation of high-performance parallel programs for a class of computations encountered in quantum chemistry and...
Gerald Baumgartner, David E. Bernholdt, Daniel Coc...
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 8 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
JCC
2010
105views more  JCC 2010»
13 years 7 months ago
Fast determination of the optimal rotational matrix for macromolecular superpositions
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...
Pu Liu, Dimitris K. Agrafiotis, Douglas L. Theobal...
JMLR
2012
11 years 11 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
IPPS
2006
IEEE
14 years 2 months ago
A parallel memetic algorithm applied to the total tardiness machine scheduling problem
This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the gene...
Vinícius Garcia, Paulo M. França, Al...