303 search results - page 42 / 61 » Automata on Gauss Words |
CPM
1999
Springer
14 years 2 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
TCS
2008
13 years 9 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
DAGM
2008
Springer
13 years 11 months ago
2008
Springer
This paper introduces an novel framework for speech understanding using extended context-free grammars (ECFGs) by combining statistical methods and rule based knowledge. By only us...
ATVA
2011
Springer
12 years 9 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
ICLA
2009
Springer
14 years 4 months ago
2009
Springer
One of the surprising developments in the area of program verification is how ideas introduced by logicians in the early part of the 20th Century ended up yielding by the 21 Centu...