The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
This paper describes the participation of UAIC team at the LogCLEF 2011 initiative, language identification task. Our approach is an aggregation of known methods for recognizing la...
Abstract. We show that several previously proposed passage-based document ranking principles, along with some new ones, can be derived from the same probabilistic model. We use lan...
The development of software for wireless sensor networks is involved and complex. This does not only impose much work on programmers but also prevents domain experts from directly ...