Sciweavers

216 search results - page 23 / 44
» Self Assembling Graphs
Sort
View
NN
2006
Springer
127views Neural Networks» more  NN 2006»
13 years 9 months ago
Assessing self organizing maps via contiguity analysis
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
Ludovic Lebart
SOFSEM
1997
Springer
14 years 2 months ago
Time Optimal Self-Stabilizing Algorithms
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
Rastislav Kralovic
ICCAD
2005
IEEE
93views Hardware» more  ICCAD 2005»
14 years 6 months ago
Eliminating wire crossings for molecular quantum-dot cellular automata implementation
— When exploring computing elements made from technologies other than CMOS, it is imperative to investigate the effects of physical implementation constraints. This paper focuses...
Amitabh Chaudhary, Danny Z. Chen, Kevin Whitton, M...
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
14 years 1 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...
JSC
2007
63views more  JSC 2007»
13 years 9 months ago
On the geometry of parametrized bicubic surfaces
We start the study of the problem of describing the double point locus of a bicubic surface. Our motivation is to determine, whether a real bicubic patch over the unit square will...
André Galligo, Michael Stillman