Sciweavers

133 search results - page 7 / 27
» Recognizing Mathematical Expressions Using Tree Transformati...
Sort
View
113
Voted
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 6 months ago
Streaming Tree Transducers
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
Rajeev Alur, Loris D'Antoni
85
Voted
ICFP
2006
ACM
15 years 11 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya
119
Voted
ACL
1997
15 years 29 days ago
Representing Constraints with Automata
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
Frank Morawietz, Tom Cornell
ICDAR
2011
IEEE
13 years 11 months ago
Math Spotting: Retrieving Math in Technical Documents Using Handwritten Query Images
—A method for locating mathematical expressions in document images without the use of optical character recognition is presented. An index of document regions is produced from re...
Richard Zanibbi, Li Yu
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 1 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau