Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
Transactional Memory (TM) is a promising abstraction as it hides all synchronization complexities from the programmers of concurrent applications. More particularly the TM paradig...
Derin Harmanci, Vincent Gramoli, Pascal Felber, Ch...
We address the problem of simplifying Portuguese texts at the sentence level treating it as a "translation task". We use the Statistical Machine Translation (SMT) framewo...
A common theoretical assumption in the study of information flow security in Java-like languages is that pointers are opaque – i.e., that the only properties that can be observ...
We present a methodology for modeling heterogeneous real-time components. Components are obtained as the superposition of three layers : Behavior, specified as a set of transitio...