Sciweavers

364 search results - page 35 / 73
» On the generalization of soft margin algorithms
Sort
View
TNN
2011
107views more  TNN 2011»
13 years 4 months ago
Iterative Gaussianization: From ICA to Random Rotations
Abstract—Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this paper, we propose a solution to t...
Valero Laparra, Gustavo Camps-Valls, Jesus Malo
JMLR
2010
121views more  JMLR 2010»
13 years 3 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
14 years 1 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
ICIP
2008
IEEE
14 years 3 months ago
MAP-MRF approach for binarization of degraded document image
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
Jung Gap Kuk, Nam Ik Cho, Kyoung Mu Lee
DAC
2009
ACM
14 years 10 months ago
Improving testability and soft-error resilience through retiming
State elements are increasingly vulnerable to soft errors due to their decreasing size, and the fact that latched errors cannot be completely eliminated by electrical or timing ma...
Smita Krishnaswamy, Igor L. Markov, John P. Hayes