Sciweavers

375 search results - page 1 / 75
» Accelerated spectral approximation
Sort
View
MOC
1998
73views more  MOC 1998»
13 years 4 months ago
Accelerated spectral approximation
Abstract. A systematic development of higher order spectral analysis, introduced by Dellwo and Friedman, is undertaken in the framework of an appropriate product space. Accelerated...
Rafikul Alam, Rekha P. Kulkarni, Balmohan V. Limay...
PKDD
2004
Springer
116views Data Mining» more  PKDD 2004»
13 years 10 months ago
Random Matrices in Data Analysis
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
Dimitris Achlioptas
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 5 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
JEI
2007
90views more  JEI 2007»
13 years 4 months ago
Accelerating spectral-based color separation within the Neugebauer subspace
Spectral separation is the process of obtaining printer control values to reproduce a given spectral reflectance. Given a multispectral image where each pixel represents a spectra...
Philipp Urban, Mitchell R. Rosen, Roy S. Berns
SIAMMAX
2011
157views more  SIAMMAX 2011»
12 years 7 months ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...