1064 search results - page 64 / 213 » Single Tree Grammars |
108
Voted
DCC
2007
IEEE
16 years 3 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
106
Voted
PADL
2001
Springer
15 years 8 months ago
2001
Springer
The goal of this project is to develop solutions to enhance interoperability between bioinformatics applications. Most existing applications adopt different data formats, forcing ...
133
Voted
DEXA
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
125
Voted
EWHCI
1995
15 years 7 months ago
1995
Diagrams (e.g., trees for hierarchical structures, or graphs for finite state machines) are often needed as part of advanced user interfaces, and are frequently specific to a use...
143
Voted
VL
1995
IEEE
15 years 7 months ago
1995
IEEE
Diagrams (e.g., flowcharts, trees for hierarchical structures, or graphs for finite state machines) are often needed as part of visual language systems and advanced user interfa...