Sciweavers

72 search results - page 6 / 15
» Finite sample effects of the fast ICA algorithm
Sort
View
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 7 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
SIAMMAX
2010
189views more  SIAMMAX 2010»
13 years 2 months ago
Fast Algorithms for the Generalized Foley-Sammon Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the most popular approaches for feature extraction and dimension reduction to overcome the curse of the dimensionality of the high-dime...
Lei-Hong Zhang, Li-Zhi Liao, Michael K. Ng
CGI
1998
IEEE
13 years 11 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
JCP
2008
86views more  JCP 2008»
13 years 7 months ago
Wordlength Estimation of Digital Controller Synthesis for Inkjet Printer Mechanism
The effect of finite wordlength on coefficients in implementing discrete-time controllers has been a subject of many recent studies. Especially, this issue is more severe in the lo...
Hung-Ming Cheng
RECOMB
2008
Springer
14 years 7 months ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...