105 search results - page 2 / 21 » Tree Structure Compression with RePair |
ESANN
2006
13 years 7 months ago
2006
We explore the capability of the Self Organizing Map for structured data (SOM-SD) to compress continuous time data recorded from a kinematic tree, which can represent a robot or an...
DATESO
2009
13 years 3 months ago
2009
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
CPM
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
EMNLP
2007
13 years 7 months ago
2007
This paper presents a tree-to-tree transduction method for text rewriting. Our model is based on synchronous tree substitution grammar, a formalism that allows local distortion of...
WEA
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...