Sciweavers

407 search results - page 40 / 82
» On the least median square problem
Sort
View
CORR
2010
Springer
61views Education» more  CORR 2010»
14 years 12 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
CORR
2007
Springer
84views Education» more  CORR 2007»
14 years 11 months ago
MMSE Optimal Algebraic Space-Time Codes
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
G. Susinder Rajan, B. Sundar Rajan
SMA
2008
ACM
162views Solid Modeling» more  SMA 2008»
14 years 11 months ago
Fast and robust bootstrap
The Least Trimmed Squares (LTS) estimator is a frequently used robust estimator of regression. When it comes to inference for the parameters of the regression model, the asymptoti...
Matias Salibian-Barrera, Stefan Van Aelst, Gert Wi...
TIP
2010
155views more  TIP 2010»
14 years 10 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
CVPR
2012
IEEE
13 years 2 months ago
A simple prior-free method for non-rigid structure-from-motion factorization
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...
Yuchao Dai, Hongdong Li, Mingyi He