Sciweavers

216 search results - page 24 / 44
» Self Assembling Graphs
Sort
View
PODC
1990
ACM
14 years 1 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran
ICAS
2006
IEEE
143views Robotics» more  ICAS 2006»
14 years 3 months ago
Towards Autonomic Distribution of Existing Object Oriented Programs
By harnessing computational power of distributed heterogeneous resources, it is possible to build a large scale integrated system so that a centralized program is partitioned and ...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
INEX
2005
Springer
14 years 3 months ago
Clustering XML Documents Using Self-organizing Maps for Structures
Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents formatted in XML are appropriately represented as graph ...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...
BMCBI
2010
189views more  BMCBI 2010»
13 years 10 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
ICDM
2009
IEEE
153views Data Mining» more  ICDM 2009»
13 years 7 months ago
A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
Fabrice Muhlenbach, Stéphane Lallich