Sciweavers

928 search results - page 65 / 186
» The Convergence Rate of AdaBoost
Sort
View
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 9 months ago
Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes
— It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/...
Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ia...
JMLR
2012
12 years 12 days ago
Sparse Additive Machine
We develop a high dimensional nonparametric classification method named sparse additive machine (SAM), which can be viewed as a functional version of support vector machine (SVM)...
Tuo Zhao, Han Liu
SIAMSC
2008
165views more  SIAMSC 2008»
13 years 10 months ago
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Abstract. A new iterative algorithm for the solution of minimization problems in infinitedimensional Hilbert spaces which involve sparsity constraints in form of p-penalties is pro...
Kristian Bredies, Dirk A. Lorenz
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
13 years 5 months ago
Random projection algorithms for convex set intersection problems
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Angelia Nedic
ICASSP
2008
IEEE
14 years 4 months ago
Iterative extrapolation algorithm for data reconstruction over sphere
Given limited or incomplete measurement data on a sphere, a new iterative algorithm is proposed on how to extrapolate signal over the whole sphere. The algorithm is based on a pri...
Wen Zhang, Rodney A. Kennedy, Thushara D. Abhayapa...