9444 search results - page 1510 / 1889 » The Language Model LMNtal |
175
Voted
GFKL
2006
Springer
15 years 10 months ago
2006
Springer
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
201
click to vote
AINA
2003
IEEE
15 years 10 months ago
2003
IEEE
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
204
click to vote
CASES
2001
ACM
15 years 10 months ago
2001
ACM
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
163
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
173
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...