Sciweavers

675 search results - page 91 / 135
» On Compression of Parse Trees
Sort
View
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
14 years 28 days ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
JMIV
2002
126views more  JMIV 2002»
13 years 8 months ago
Tree-Structured Haar Transforms
In our recent work, a class of parametric transforms, including family of Haar-like transforms, was introduced and studied in application to image compression. Parametric Haar-lik...
Karen O. Egiazarian, Jaakko Astola
CADE
2001
Springer
14 years 9 months ago
Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
Jörg Lücke
TAL
2004
Springer
14 years 2 months ago
Automatic Acquisition of Transfer Rules from Translation Examples
In our research, we have developed a transfer-based machine translation architecture for the translation from Japanese into German. One main feature of the system is the fully auto...
Werner Winiwarter
ACL
2001
13 years 10 months ago
A Syntax-based Statistical Translation Model
We present a syntax-based statistical translation model. Our model transforms a source-language parse tree into a target-language string by applying stochastic operations at each ...
Kenji Yamada, Kevin Knight