In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
In this exploratory case study, effort distribution visualizations of industrial software development projects are made in order to assess to what extent patterns can be found tha...
The main challenge of dynamic analysis is the huge volume of data, making it difficult to extract high level views. Most techniques developed so far adopt a finegrained approach ...
Well-designed object-oriented programs typically consist of a few key classes that work tightly together to provide the bulk of the functionality. As such, these key classes are e...
Andy Zaidman, Toon Calders, Serge Demeyer, Jan Par...
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...