Sciweavers

1399 search results - page 94 / 280
» Multi-party Finite Computations
Sort
View
TIT
2008
90views more  TIT 2008»
13 years 10 months ago
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
This paper derives an improved sphere-packing (ISP) bound for finite-length error-correcting codes whose transmission takes place over symmetric memoryless channels, and the codes...
Gil Wiechman, Igal Sason
JALC
2007
79views more  JALC 2007»
13 years 10 months ago
Two-Way Finite Automata with a Write-Once Track
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
Berke Durak
JUCS
2002
119views more  JUCS 2002»
13 years 9 months ago
Error-Correction, and Finite-Delay Decodability
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
Stavros Konstantinidis
JCC
2010
74views more  JCC 2010»
13 years 8 months ago
A first-order system least-squares finite element method for the Poisson-Boltzmann equation
The Poisson-Boltzmann equation is an important tool in modeling solvent in biomolecular systems. In this paper, we focus on numerical approximations to the electrostatic potential...
Stephen D. Bond, Jehanzeb Hameed Chaudhry, Eric C....
SIAMSC
2010
117views more  SIAMSC 2010»
13 years 8 months ago
Least-Squares Finite Element Methods for Quantum Electrodynamics
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...