Sciweavers

2223 search results - page 240 / 445
» Ontological Framework for Approximation
Sort
View
ICA
2010
Springer
15 years 6 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
CGF
2010
113views more  CGF 2010»
15 years 5 months ago
Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets
We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous...
Patrick Mullen, Fernando de Goes, Mathieu Desbrun,...
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 5 months ago
A Multilevel Approach For Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
Nicolas Gillis, François Glineur
CORR
2002
Springer
132views Education» more  CORR 2002»
15 years 5 months ago
Robust Feature Selection by Mutual Information Distributions
Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address question...
Marco Zaffalon, Marcus Hutter
JAIR
2010
130views more  JAIR 2010»
15 years 3 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...