The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
Teaching fundamental programming to freshmen is a hard task to be performed, given the high level action and logical reasoning that are required for these students to develop in a...
Cristiane Camilo Hernandez, Luciano Silva, Rafael ...
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
Jan Smans, Bart Jacobs, Frank Piessens, Wolfram Sc...
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...