Sciweavers

9 search results - page 1 / 2
» The SPARAMAT Approach to Automatic Comprehension of Sparse M...
Sort
View
IWPC
1999
IEEE
13 years 9 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
Christoph W. Keßler, Craig Smith
ICPR
2010
IEEE
13 years 12 months ago
Bayesian Inference for Nonnegative Matrix Factor Deconvolution Models
In this paper we develop a probabilistic interpretation and a full Bayesian inference for non-negative matrix deconvolution (NMFD) model. Our ultimate goal is unsupervised extract...
Serap Kirbiz, Ali Taylan Cemgil, Bilge Gunsel
ICCV
2003
IEEE
14 years 6 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
TSP
2010
12 years 11 months ago
Variance-component based sparse signal reconstruction and model selection
We propose a variance-component probabilistic model for sparse signal reconstruction and model selection. The measurements follow an underdetermined linear model, where the unknown...
Kun Qiu, Aleksandar Dogandzic
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 20 days ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...