Optimal Parallel Algorithm for Finding $st$-Ambitus of a Planar Biconnected Graph

Algorithmica ◽  
1996 ◽  
Vol 15 (3) ◽  
pp. 242
Author(s):  
K.S. Easwarakumar ◽  
S.V. Krishnan ◽  
C. Pandu Rangan ◽  
S. Seshadri
Keyword(s):  
Parallel Algorithm ◽  
Biconnected Graph

Optimal parallel algorithm for findingst-ambitus of a planar biconnected graph

Algorithmica ◽  
1996 ◽  
Vol 15 (3) ◽  
pp. 242-255
Author(s):  
K. S. Easwarakumar ◽  
S. V. Krishnan ◽  
C. Pandu Rangan ◽  
S. Seshadri
Keyword(s):  
Parallel Algorithm ◽  
Biconnected Graph

Parallel algorithm for Turbo codes

2010 ◽  
Vol 24 (7) ◽  
pp. 638-642
Author(s):  
Linli Cui ◽  
Fan Yang ◽  
Qicong Peng
Keyword(s):  
Parallel Algorithm ◽  
Turbo Codes

Parallel algorithm for solving sparse linear systems

1996 ◽  
Vol 32 (19) ◽  
pp. 1766
Author(s):  
K.N. Balasubramanya Murthy ◽  
C. Siva Ram Murthy
Keyword(s):  
Parallel Algorithm ◽  
Linear Systems ◽  
Sparse Linear Systems

scholarly journals A Wavelet-Based Almost-Sure Uniform Approximation of Fractional Brownian Motion with a Parallel Algorithm

2014 ◽  
Vol 51 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Dawei Hong ◽  
Shushuang Man ◽  
Jean-Camille Birget ◽  
Desmond S. Lun
Keyword(s):  
Brownian Motion ◽  
Convergence Rate ◽  
Fractional Brownian Motion ◽  
Parallel Algorithm ◽  
Uniform Approximation ◽  
Haar Wavelets ◽  
Hurst Index ◽  
Sample Paths ◽  
Vanishing Moment ◽  
Uniform Expansion

We construct a wavelet-based almost-sure uniform approximation of fractional Brownian motion (FBM) (Bt(H))_t∈[0,1] of Hurst index H ∈ (0, 1). Our results show that, by Haar wavelets which merely have one vanishing moment, an almost-sure uniform expansion of FBM for H ∈ (0, 1) can be established. The convergence rate of our approximation is derived. We also describe a parallel algorithm that generates sample paths of an FBM efficiently.

Sign in / Sign up

Export Citation Format

Share Document