Sciweavers

393 search results - page 54 / 79
» Direct Sparse Deblurring
Sort
View
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 8 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
CISS
2008
IEEE
14 years 2 months ago
Sparsity in MRI RF excitation pulse design
—Magnetic resonance imaging (MRI) may be viewed as a two-stage experiment that yields a non-invasive spatial mapping of hydrogen nuclei in living subjects. Nuclear spins within a...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 2 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
IPPS
2005
IEEE
14 years 1 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...