Sciweavers

1177 search results - page 133 / 236
» Iterative methods for Robbins problems
Sort
View
OL
2011
332views Neural Networks» more  OL 2011»
14 years 7 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
98
Voted
SIGMOD
2004
ACM
118views Database» more  SIGMOD 2004»
16 years 21 days ago
Effective Use of Block-Level Sampling in Statistics Estimation
Block-level sampling is far more efficient than true uniform-random sampling over a large database, but prone to significant errors if used to create database statistics. In this ...
Surajit Chaudhuri, Gautam Das, Utkarsh Srivastava
94
Voted
ICCAD
1999
IEEE
101views Hardware» more  ICCAD 1999»
15 years 4 months ago
Efficient model reduction of interconnect via approximate system gramians
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
Jing-Rebecca Li, Jacob White
ICASSP
2011
IEEE
14 years 4 months ago
Resolving FD-BSS permutation for arbitrary array in presence of spatial aliasing
This paper presents a novel method for solving the permutation problem inherent to frequency domain blind signal separation of multiple simultaneous speakers. As conventional meth...
Jani Even, Norihiro Hagita
ICASSP
2011
IEEE
14 years 4 months ago
Langevin and hessian with fisher approximation stochastic sampling for parameter estimation of structured covariance
We have studied two efficient sampling methods, Langevin and Hessian adapted Metropolis Hastings (MH), applied to a parameter estimation problem of the mathematical model (Lorent...
Cornelia Vacar, Jean-François Giovannelli, ...