Sciweavers

104 search results - page 14 / 21
» An Overview Of Inverse Problem Regularization Using Sparsity
Sort
View
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
15 years 4 months ago
Estimating the number of segments in time series data using permutation tests
Segmentation is a popular technique for discovering structure in time series data. We address the largely open problem of estimating the number of segments that can be reliably di...
Kari Vasko, Hannu Toivonen
APWEB
2003
Springer
15 years 2 months ago
A Web User Profiling Approach
People display regularities in almost everything they do. This paper proposes characteristics of an idealized algorithm that would allow an automatic extraction of web user profil ...
Younes Hafri, Chabane Djeraba, Peter L. Stanchev, ...
ICCV
2005
IEEE
16 years 1 months ago
A Graph Cut Algorithm for Generalized Image Deconvolution
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
Ashish Raj, Ramin Zabih
90
Voted
ICCV
2007
IEEE
16 years 1 months ago
Fast Pixel/Part Selection with Sparse Eigenvectors
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
Bernard Moghaddam, Yair Weiss, Shai Avidan
NIPS
2008
15 years 18 days ago
Robust Regression and Lasso
We consider robust least-squares regression with feature-wise disturbance. We show that this formulation leads to tractable convex optimization problems, and we exhibit a particul...
Huan Xu, Constantine Caramanis, Shie Mannor