1523 search results - page 132 / 305 » The Computational Complexity of Linear Optics |
126
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
117
Voted
SC
2004
ACM
15 years 9 months ago
2004
ACM
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
138
Voted
MP
2008
15 years 3 months ago
2008
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
113
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
143
Voted
SIAMSC
2008
15 years 3 months ago
2008
Here we develop an option pricing method for European options based on the Fourier-cosine series, and call it the COS method. The key insight is in the close relation of the charac...