Sciweavers

323 search results - page 25 / 65
» New Algorithms for Learning in Presence of Errors
Sort
View
ICA
2010
Springer
13 years 9 months ago
Dictionary Learning for Sparse Representations: A Pareto Curve Root Finding Approach
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
Mehrdad Yaghoobi, Mike E. Davies
ICANN
2003
Springer
14 years 1 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
GLOBECOM
2008
IEEE
14 years 3 months ago
A Supervised Learning Approach to Adaptation in Practical MIMO-OFDM Wireless Systems
—MIMO-OFDM wireless systems require adaptive modulation and coding based on channel state information (CSI) to maximize throughput in changing wireless channels. Traditional adap...
Robert C. Daniels, Constantine Caramanis, Robert W...
ICML
2008
IEEE
14 years 9 months ago
ICA and ISA using Schweizer-Wolff measure of dependence
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...
Barnabás Póczos, Sergey Kirshner
ICCV
1999
IEEE
14 years 29 days ago
A Subset Approach to Contour Tracking in Clutter
A new method for tracking contours of moving objects in clutter is presented. For a given object, a model of its contours is learned from training data in the form of a subset of ...
Daniel Freedman, Michael S. Brandstein