224 search results - page 13 / 45 » Three New Algorithms for Regular Language Enumeration |
131
click to vote
SODA
2010
ACM
15 years 9 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, ...
94
Voted
EUROCRYPT
1999
Springer
15 years 4 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 3 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...
125
Voted
EMNLP
2011
13 years 11 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 ...
117
Voted
CORR
2008
Springer
14 years 11 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...