Background: Amino acid sequence probability distributions, or profiles, have been used successfully to predict secondary structure and local structure in proteins. Profile models ...
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
Recently, several soft shadow mapping algorithms have been introduced which extract micro-occluders from a shadow map and backproject them on the light source to approximately det...