Sciweavers

139 search results - page 9 / 28
» Fast perfect sampling from linear extensions
Sort
View
CVPR
2005
IEEE
14 years 10 months ago
Nonparametric Subspace Analysis for Face Recognition
Linear discriminant analysis (LDA) is a popular face recognition technique. However, an inherent problem with this technique stems from the parametric nature of the scatter matrix...
Zhifeng Li, Wei Liu, Dahua Lin, Xiaoou Tang
TSP
2008
98views more  TSP 2008»
13 years 7 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David
ICASSP
2008
IEEE
14 years 2 months ago
Compressed sensing with sequential observations
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of measurements. The results in the literature have focuse...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
CCGRID
2010
IEEE
13 years 8 months ago
Discovering Piecewise Linear Models of Grid Workload
—Despite extensive research focused on enabling QoS for grid users through economic and intelligent resource provisioning, no consensus has emerged on the most promising strategi...
Tamás Éltetö, Cécile Ger...
CVPR
2010
IEEE
13 years 8 months ago
Region moments: Fast invariant descriptors for detecting small image structures
This paper presents region moments, a class of appearance descriptors based on image moments applied to a pool of image features. A careful design of the moments and the image fea...
Gianfranco Doretto, Yi Yao