nded Abstract – Oleg Parshin∗ Abdur Rakib† Stephan Thesing∗ Reinhard Wilhelm∗ The precise determination of worst-case execution times (WCETs) for programs is mostly bein...
Abdur Rakib, Oleg Parshin, Stephan Thesing, Reinha...
Abstract. This paper reports on the experiences we gained while trying to build an interpreter for a new programming language aimed at developing strong mobile software. The interp...
Tom Van Cutsem, Stijn Mostinckx, Wolfgang De Meute...
Abstract. We present Filtron, a prototype anti-spam filter that integrates the main empirical conclusions of our comprehensive analysis on using machine learning to construct eff...
Eirinaios Michelakis, Ion Androutsopoulos, Georgio...
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
Abstract. Probabilistic finite automata (PFA) model stochastic languages, i.e. probability distributions over strings. Inferring PFA from stochastic data is an open field of rese...