When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Warehouse view self-maintenance refers to maintaining materialized views at a data warehouse without accessing source data. Self-maintenance has been studied for nontemporal views...