We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
We have developed and maintained a set of closely related compilers. Although much of their code is duplicated and shared, they have been maintained separately because they are tr...
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
The distribution of illnesses reported by emergency departments from hospitals in a region under surveillance is particularly informative for the early detection of epidemics. The...
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...