A parallel algorithm for the monadic unification problem

1985 ◽  
Vol 25 (2) ◽  
pp. 302-306 ◽  
Author(s):  
Ivan E. Auger ◽  
M. S. Krishnamoorthy
Keyword(s):  
Parallel Algorithm ◽  
Unification Problem

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.

Type Inference: Some Results, Some Problems1

1993 ◽  
Vol 19 (1-2) ◽  
pp. 87-125
Author(s):  
Paola Giannini ◽  
Furio Honsell ◽  
Simona Ronchi Della Rocca
Keyword(s):  
Large Class ◽  
Higher Order ◽  
Type Inference ◽  
Principal Type ◽  
Open Problems ◽  
Inference Problem ◽  
Type Assignment ◽  
Unification Problem

In this paper we investigate the type inference problem for a large class of type assignment systems for the λ-calculus. This is the problem of determining if a term has a type in a given system. We discuss, in particular, a collection of type assignment systems which correspond to the typed systems of Barendregt’s “cube”. Type dependencies being shown redundant, we focus on the strongest of all, Fω, the type assignment version of the system Fω of Girard. In order to manipulate uniformly type inferences we give a syntax directed presentation of Fω and introduce the notions of scheme and of principal type scheme. Making essential use of them, we succeed in reducing the type inference problem for Fω to a restriction of the higher order semi-unification problem and in showing that the conditional type inference problem for Fω is undecidable. Throughout the paper we call attention to open problems and formulate some conjectures.

Sign in / Sign up

Export Citation Format

Share Document