The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
We propose a new rendering technique that produces 3-D images with enhanced visual comprehensibility. Shape features can be readily understood if certain geometric properties are ...
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
Abstract. In this paper we describe anomaly-based intrusion detection as a specialized case of the more general behavior detection problem. We draw concepts from the field of etho...
The choice of mapping strategies to effectively map controller variables to sound synthesis algorithms is examined. Specifically, we look at continuous mappings that have a geom...
Doug Van Nort, Marcelo M. Wanderley, Philippe Depa...