Sciweavers

160 search results - page 10 / 32
» Sparse decompositions in
Sort
View
DCC
2004
IEEE
15 years 10 months ago
Predicting Wavelet Coefficients Over Edges Using Estimates Based on Nonlinear Approximants
It is well-known that wavelet transforms provide sparse decompositions over many types of image regions but not over image singularities/edges that manifest themselves along curve...
Onur G. Guleryuz
ML
2002
ACM
163views Machine Learning» more  ML 2002»
14 years 10 months ago
Structural Modelling with Sparse Kernels
A widely acknowledged drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is extremely difficult to interpret. A numb...
Steve R. Gunn, Jaz S. Kandola
ICDM
2008
IEEE
141views Data Mining» more  ICDM 2008»
15 years 4 months ago
Scalable Tensor Decompositions for Multi-aspect Data Mining
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...
Tamara G. Kolda, Jimeng Sun
PPAM
2001
Springer
15 years 2 months ago
pARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solutio...
Yousef Saad, Masha Sosonkina
CORR
2004
Springer
152views Education» more  CORR 2004»
14 years 10 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer