Sciweavers

3941 search results - page 161 / 789
» Computational Efficiency of Batching Methods
Sort
View
CSDA
2008
65views more  CSDA 2008»
15 years 2 months ago
Improving updating rules in multiplicative algorithms for computing D-optimal designs
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove a monotonicity result for a ...
Holger Dette, Andrey Pepelyshev, Anatoly A. Zhiglj...
118
Voted
CORR
2002
Springer
123views Education» more  CORR 2002»
15 years 2 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
127
Voted
DAC
2000
ACM
16 years 3 months ago
Efficient variable ordering using aBDD based sampling
Variable ordering for BDDs has been extensively investigated. Recently, sampling based ordering techniques have been proposed to overcome problems with structure based static orde...
Yuan Lu, Jawahar Jain, Edmund M. Clarke, Masahiro ...
134
Voted
WISA
2004
Springer
15 years 8 months ago
Secure and Efficient AES Software Implementation for Smart Cards
In implementing cryptographic algorithms on limited devices such as smart cards, speed and memory optimization had always been a challenge. With the advent of side channel attacks,...
Elena Trichina, Lesya Korkishko
ICASSP
2010
IEEE
15 years 2 months ago
An efficient particle filtering technique on the Grassmann manifold
Subspace tracking methods are widespread in signal and image processing. To reduce the influence of perturbations or outliers on the measurements, some authors have used a stocha...
Quentin Rentmeesters, Pierre-Antoine Absil, Paul V...