Sciweavers

385 search results - page 8 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
14 years 9 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010
GLVLSI
2006
IEEE
98views VLSI» more  GLVLSI 2006»
14 years 3 months ago
Rapid intermodulation distortion estimation in fully balanced weakly nonlinear Gm-C filters using state-space modeling
State-space modeling of fully differential Gm-C filters with weak nonlinearities is used to develop a fast algorithm for intermodulation distortion estimation. It results in sim...
Paul Sotiriadis, Abdullah Celik, Zhaonian Zhang
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 10 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
SPAA
1999
ACM
14 years 1 months ago
Recursive Array Layouts and Fast Parallel Matrix Multiplication
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system...
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K....
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
14 years 24 days ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala