We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
Abstract. This paper studies the properties and performance of models for estimating local probability distributions which are used as components of larger probabilistic systems ...
Kristina Toutanova, Mark Mitchell, Christopher D. ...
In a peer-to-peer file-sharing system, a client desiring a particular file must choose a source from which to download. The problem of selecting a good data source is difficult...
Daniel S. Bernstein, Zhengzhu Feng, Brian Neil Lev...
We developed a multithreaded parallel implementation of a sequence alignment algorithm that is able to align whole genomes with reliable output and reasonable cost. This paper pres...
Juan del Cuvillo, Xinmin Tian, Guang R. Gao, Milin...
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...