Sciweavers

187 search results - page 11 / 38
» Generic Graph Algorithms for Sparse Matrix Ordering
Sort
View
INTERSPEECH
2010
14 years 4 months ago
A factorial sparse coder model for single channel source separation
We propose a probabilistic factorial sparse coder model for single channel source separation in the magnitude spectrogram domain. The mixture spectrogram is assumed to be the sum ...
Robert Peharz, Michael Stark, Franz Pernkopf, Yann...
STACS
2009
Springer
15 years 4 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
IMAMS
2003
125views Mathematics» more  IMAMS 2003»
14 years 10 months ago
A Graph-Spectral Method for Surface Height Recovery
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
Antonio Robles-Kelly, Edwin R. Hancock
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
15 years 26 days ago
Parametric model order reduction accelerated by subspace recycling
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
Lihong Feng, Peter Benner, Jan G. Korvink
JMLR
2006
104views more  JMLR 2006»
14 years 9 months ago
Learning Image Components for Object Recognition
In order to perform object recognition it is necessary to learn representations of the underlying components of images. Such components correspond to objects, object-parts, or fea...
Michael W. Spratling