412 search results - page 56 / 83 » Bootstrapping Rule Induction |
123
click to vote
AAAI
1994
15 years 3 months ago
1994
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
128
click to vote
RAID
1999
Springer
15 years 6 months ago
1999
Springer
We have been developing a data mining (i.e., knowledge discovery) framework, MADAM ID, for Mining Audit Data for Automated Models for Intrusion Detection [LSM98, LSM99b, LSM99a]. ...
100
Voted
ICML
2006
IEEE
16 years 3 months ago
2006
IEEE
Many of today's best classification results are obtained by combining the responses of a set of base classifiers to produce an answer for the query. This paper explores a nov...
107
click to vote
IIE
2006
15 years 2 months ago
2006
We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the abilit...
231
Voted
POPL
2008
ACM
16 years 2 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...