For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
Abstract—In contrast to standard fuzzy clustering, which optimizes a set of prototypes, one for each cluster, this paper studies fuzzy clustering without prototypes. Starting fro...
A new technique for designing an LC bandpass DeltaSigma modulator is presented. This method is based on pulse shaping of a DAC output signal such that one can realize a desired (a...
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...