252 search results - page 42 / 51 » Automata for Data Words and Data Trees |
109
click to vote
IJSI
2008
14 years 11 months ago
2008
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
JACM
2000
14 years 11 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
108
click to vote
NIPS
2003
15 years 1 months ago
2003
We describe a pattern acquisition algorithm that learns, in an unsupervised fashion, a streamlined representation of linguistic structures from a plain natural-language corpus. Th...
123
click to vote
COLING
2002
14 years 11 months ago
2002
In this paper we investigate the task of automatically identifying the correct argument structure for a set of verbs. The argument structure of a verb allows us to predict the rel...
124
click to vote
STACS
1992
Springer
15 years 3 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...