Sciweavers

207 search results - page 23 / 42
» The Polynomial Method for Random Matrices
Sort
View
ICA
2004
Springer
14 years 3 months ago
Blind Signal Separation of Convolutive Mixtures: A Time-Domain Joint-Diagonalization Approach
We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary a...
Marcel Joho
NIPS
1993
13 years 11 months ago
Fast Pruning Using Principal Components
We present a new algorithm for eliminating excess parameters and improving network generalization after supervised training. The method, \Principal Components Pruning (PCP)",...
Asriel U. Levin, Todd K. Leen, John E. Moody
ICCAD
2009
IEEE
136views Hardware» more  ICCAD 2009»
13 years 7 months ago
A hierarchical floating random walk algorithm for fabric-aware 3D capacitance extraction
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
Tarek A. El-Moselhy, Ibrahim M. Elfadel, Luca Dani...
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
14 years 1 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova
INFOCOM
2007
IEEE
14 years 4 months ago
Queuing Delays in Randomized Load Balanced Networks
—Valiant’s concept of Randomized Load Balancing (RLB), also promoted under the name ‘two-phase routing’, has previously been shown to provide a cost-effective way of implem...
Ravi Prasad, Peter J. Winzer, Sem C. Borst, Marina...