10890 search results - page 2 / 2178 » Automatic Complexity Analysis |
CADE
2008
Springer
13 years 9 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
EMNLP
2007
13 years 9 months ago
2007
This paper discusses automatic determination of case in Arabic. This task is an important part and major source of errors in full diacritization of Arabic. We use a goldstandard s...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
GI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract: Protection and surveillance of persons and facilities is frequently associated with automatic tracking of striking objects like vehicles or persons in an image sequence. ...
TSMC
2008
13 years 7 months ago
2008
In most real-world problems, we either know little about the problems or the problems are too complex to have a clear vision on how to decompose them by hand. Thus, it is usually d...