Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
Emerging pervasive computing technologies such as sensor networks and RFID tags can be embedded in our everyday environment to digitally store and elaborate a variety of informatio...
Abstract. This paper provides baseline results for the medical automatic annotation task of CLEF 2007 by applying the image retrieval in medical applications (IRMA)-based algorithm...
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
Robert Mateescu, Radu Marinescu 0002, Rina Dechter
We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and...
Sven Helmer, Robin Aly, Thomas Neumann, Guido Moer...