This paperintroduces the notion of “universalinteraction,” allowing a device to adapt its functionality to exploit services it discovers as it moves into a new environment. Us...
Todd D. Hodes, Randy H. Katz, Edouard Servan-Schre...
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Abstract. Medical reports are predominantly written in natural language; as such they are not computer-accessible. A common way to make medical narrative accessible to automated sy...
Janneke van der Zwaan, Erik F. Tjong Kim Sang, Maa...
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
Object invariants describe the consistency of object states, and are crucial for reasoning about the correctness of object-oriented programs. However, reasoning about object invari...