224 search results - page 13 / 45 » Three New Algorithms for Regular Language Enumeration |
116
click to vote
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
EUROCRYPT
1999
Springer
15 years 1 months ago
1999
Springer
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
108
click to vote
EMNLP
2011
13 years 9 months ago
2011
Linear models have enjoyed great success in structured prediction in NLP. While a lot of progress has been made on efficient training with several loss functions, the problem of ...
102
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...