Sciweavers

81 search results - page 14 / 17
» Pseudorandom Financial Derivatives
Sort
View
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 5 months ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu
ICC
2007
IEEE
387views Communications» more  ICC 2007»
14 years 5 months ago
LS Channel Estimation for Mobile OFDM Communications on Time-Varying Frequency-Selective Fading Channels
Abstract— A least-squares (LS) channel estimation (CE) technique for mobile OFDM communications over a rapidly timevarying frequency-selective fading channel is investigated in t...
Jia-Chin Lin
FOCS
1989
IEEE
14 years 2 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 2 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
TIT
2008
116views more  TIT 2008»
13 years 10 months ago
On the Complexity of Hardness Amplification
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu