In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
A number of interesting phenomena can be observed when lifelong processes of object-oriented software are analyzed from the viewpoint of software evolution. This paper proposes a ...
A development environment for RenderMan shaders has been implemented, allowing the SL programmer to observe the bahaviour of variables in both time and space. By allowing both nov...
This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from ...