Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
This paper presents a syntactic path-based learning algorithm (CANDEL from CANDIDATE-ELIMINATION) for the coreference resolution of pronouns that have their antecedents in the sam...
In this paper we describe a first version of ZEUS, a web application that combines browsing, searching and object presentation. With the zooming and panning based navigation concep...
Fredrik Gundelsweiler, Thomas Memmel, Harald Reite...
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...