Sciweavers

207 search results - page 19 / 42
» The Polynomial Method for Random Matrices
Sort
View
TSP
2011
165views more  TSP 2011»
13 years 3 months ago
Quaternion ICA From Second-Order Statistics
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
Javier Vía, Daniel P. Palomar, Luis Vielva,...
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 9 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
FOCS
1998
IEEE
14 years 22 days ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
GRID
2005
Springer
14 years 2 months ago
Highly latency tolerant Gaussian elimination
Large latencies over WAN will remain an obstacle to running communication intensive parallel applications on Grid environments. This paper takes one of such applications, Gaussian...
Toshio Endo, Kenjiro Taura
JACM
2011
98views more  JACM 2011»
13 years 3 months ago
Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
Haim Avron, Sivan Toledo