77 search results - page 16 / 16 » Polynomial Interrupt Timed Automata |
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
ML
2007
ACM
13 years 4 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...