385 search results - page 28 / 77 » A Fast Algorithm for Matrix Balancing |
DAC
1996
ACM
14 years 2 months ago
1996
ACM
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
SPAA
1998
ACM
14 years 2 months ago
1998
ACM
We present parallel algorithms for union, intersection and difference on ordered sets using random balanced binary trees (treaps [26]). For two sets of size n and m (m ≤ n) the...
ICIP
2009
IEEE
13 years 8 months ago
2009
IEEE
Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For t...
KDD
2012
ACM
12 years 18 days ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— As stateful flow-aware services are becoming commonplace, distributed router architectures have to quickly assign packets being forwarded to service-specialized proces...