In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either ...
We present a method to approximate (in any space dimension) diffusion equations with schemes having a specific structure; this structure ensures that the discrete local maximum a...
Modern Web 2.0 applications, such as GMail, Live Maps, Facebook and many others, use a combination of Dynamic HTML, JavaScript and other Web browser technologies commonly referred...
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...