We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
Given angular data 1, . . . , n [0, 2) a common objective is to estimate the density. In the case that a kernel estimator is used, bandwidth selection is crucial to the performan...
The Mondex case study about the specification and refinement of an electronic purse as defined in the Oxford Technical Monograph PRG-126 has recently been proposed as a challenge f...
Dominik Haneberg, Gerhard Schellhorn, Holger Grand...
ion, so mapping between GUI events and the underlying code is not straightforward. Code-based coverage criteria do not necessarily address problematic interactions between the GUI&...
We describe a method for constructing a structural model of an unlabeled target two-dimensional line drawing by analogy to a known source model of a drawing with similar structure...