6829 search results - page 49 / 1366 » Quantitative Generalizations of Languages |
100
Voted
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
97
Voted
IPM
2007
15 years 20 days ago
2007
For European languages, n-gram has proved to be the cost effective alternative to morphological processing during indexing task and it has been studied and analyzed extensively us...
99
Voted
ICDAR
2003
IEEE
15 years 6 months ago
2003
IEEE
Analysis of handwritten characters (allographs) plays an important role in forensic document examination. However, so far there lacks a comprehensive and quantitative study on ind...
85
Voted
AML
2006
15 years 25 days ago
2006
We prove that the existential theory of the Turing degrees, in the language with Turing reduction, 0, and unary relations for the classes in the generalized high/low hierarchy, is ...
108
Voted
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
Graph-coloring register allocation is an elegant and extremely popular optimization for modern machines. But as currently formulated, it does not handle two characteristics common...