Sciweavers

220 search results - page 16 / 44
» SMOS L1 algorithms
Sort
View
DEDS
2008
127views more  DEDS 2008»
13 years 7 months ago
Diagnosability Analysis of a Class of Hierarchical State Machines
This paper addresses the problem of Fault Detection and Isolation for a particular class of discrete event dynamical systems called Hierarchical Finite State Machines (HFSMs). A ne...
Andrea Paoli, Stéphane Lafortune
STOC
2005
ACM
118views Algorithms» more  STOC 2005»
14 years 8 months ago
Euclidean distortion and the sparsest cut
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
Sanjeev Arora, James R. Lee, Assaf Naor
WWW
2010
ACM
14 years 2 months ago
Web-scale k-means clustering
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
D. Sculley
SCALESPACE
2009
Springer
14 years 2 months ago
L0-Norm and Total Variation for Wavelet Inpainting
Abstract. In this paper, we suggest an algorithm to recover an image whose wavelet coefficients are partially lost. We propose a wavelet inpainting model by using L0-norm and the t...
Andy C. Yau, Xue-Cheng Tai, Michael K. Ng
ICML
2004
IEEE
14 years 1 months ago
Gradient LASSO for feature selection
LASSO (Least Absolute Shrinkage and Selection Operator) is a useful tool to achieve the shrinkage and variable selection simultaneously. Since LASSO uses the L1 penalty, the optim...
Yongdai Kim, Jinseog Kim