Sciweavers

417 search results - page 34 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
ICCAD
2002
IEEE
81views Hardware» more  ICCAD 2002»
14 years 5 months ago
Making Fourier-envelope simulation robust
Fourier-envelope algorithms are an important component of the mixed-signal/RF verification toolbox. In this paper, we address the unpredictability and lack of robustness that has...
Jaijeet S. Roychowdhury
IACR
2011
91views more  IACR 2011»
12 years 8 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
ICIP
2010
IEEE
14 years 2 months ago
Estimation of linear deformations of 3D objects
We propose a registration method to find affine transformations between 3D objects by constructing and solving an overdetermined system of polynomial equations. We utilize voxel...
Attila Tanács, Natasa Sladoje, Joakim Lindblad, a...
ACPC
1999
Springer
14 years 1 months ago
Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...
Yousef Saad, Masha Sosonkina
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 3 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...