This paper presents a case-study of automatic construction of a hypertext from a large full-text document. The document we used as input of the automatic authoring process is a we...
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for...
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Given some test case, a program fails. Which circumstances of the test case are responsible for the particular failure? The Delta Debugging algorithm generalizes and simplifies som...