Sciweavers

1019 search results - page 16 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
NECO
2011
13 years 3 months ago
Least-Squares Independent Component Analysis
Accurately evaluating statistical independence among random variables is a key element of Independent Component Analysis (ICA). In this paper, we employ a squared-loss variant of ...
Taiji Suzuki, Masashi Sugiyama
ESWA
2010
118views more  ESWA 2010»
13 years 7 months ago
Integrating independent component analysis-based denoising scheme with neural network for stock price prediction
The forecasting of stock price is one of the most challenging tasks in investment/financial decision-making since stock prices/indices are inherently noisy and non-stationary. In ...
Chi-Jie Lu
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 3 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 4 days ago
Robustness and modular structure in networks
Many complex systems, from power grids and the internet, to the brain and society, can be modeled using modular networks. Modules, densely interconnected groups of elements, often...
James P. Bagrow, Sune Lehmann, Yong-Yeol Ahn
ASPLOS
2006
ACM
14 years 2 months ago
Exploiting coarse-grained task, data, and pipeline parallelism in stream programs
As multicore architectures enter the mainstream, there is a pressing demand for high-level programming models that can effectively map to them. Stream programming offers an attrac...
Michael I. Gordon, William Thies, Saman P. Amarasi...