133 search results - page 5 / 27 » Recognizing Mathematical Expressions Using Tree Transformati... |
CHI
2005
ACM
15 years 10 months ago
2005
ACM
We are developing a digital writing tool, Polymorphic Letters (PL), to investigate hand and pen movements as they may extend and enrich expression in written language. PL recogniz...
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
96
Voted
IJDAR
2011
14 years 4 months ago
2011
Although publicly-available, ground-truthed corpora have proven useful for training, evaluating, and comparing recognition systems in many domains, the availability of such corpor...
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...