For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Abstract. There is rapidly growing momentum for web enabled agents that reason about and dynamically integrate the appropriate knowledge and services at run-time. The dynamic integ...
Kenneth Baclawski, Mieczyslaw M. Kokar, Paul A. Ko...
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...