Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
In this paper we present a framework for creating natural language interfaces to action-based applications. Our framework uses a number of reusable application-independent compone...
Abstract. The paper study counter-dependent pseudorandom number generators based on m-variate (m > 1) ergodic mappings of the space of 2-adic integers Z2. The sequence of intern...
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
We are developing an automatic method to compile an encyclopedic corpus from the Web. In our previous work, paragraph-style descriptions for a term are extracted from Web pages an...