Sciweavers

152 search results - page 16 / 31
» Minimality in a Linear Calculus with Iteration
Sort
View
CVPR
2009
IEEE
13 years 11 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
Roman Sandler, Michael Lindenbaum
WWW
2003
ACM
14 years 8 months ago
Extrapolation methods for accelerating PageRank computations
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...
Sepandar D. Kamvar, Taher H. Haveliwala, Christoph...
SIAMIS
2011
13 years 2 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
ICCAD
1996
IEEE
74views Hardware» more  ICCAD 1996»
13 years 11 months ago
Optimal non-uniform wire-sizing under the Elmore delay model
We consider non-uniform wire-sizing for general routing trees under the Elmore delay model. Three minimization objectives are studied: 1) total weighted sink-delays; 2) total area...
Chung-Ping Chen, Hai Zhou, D. F. Wong
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 5 months ago
On the Scaling Law for Compressive Sensing and its Applications
1 minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio...
Weiyu Xu, Ao Tang