Sciweavers

260 search results - page 29 / 52
» Degree constrained subgraphs
Sort
View
COMGEO
2010
ACM
13 years 7 months ago
Pointed binary encompassing trees: Simple and optimal
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...
TNN
1998
132views more  TNN 1998»
13 years 7 months ago
Synthesis of fault-tolerant feedforward neural networks using minimax optimization
—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...
Dipti Deodhare, M. Vidyasagar, S. Sathiya Keerthi
FUZZIEEE
2007
IEEE
14 years 1 months ago
Prototype-less Fuzzy Clustering
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...
Christian Borgelt
ISCAS
1995
IEEE
75views Hardware» more  ISCAS 1995»
13 years 11 months ago
A Multi-Feedback Design for LC Bandpass Delta-Sigma Modulators
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...
Omid Shoaei, W. Martin Snelgrove
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
13 years 11 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
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...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...