The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction...
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
The pre-processing stage of finite element analysis of the Navier-Stokes equations is becoming increasingly important as the desire for more general boundary conditions, as well a...
Anil Kumar Karanam, Kenneth E. Jansen, Christian H...