Sciweavers

216 search results - page 31 / 44
» Self Assembling Graphs
Sort
View
ICNP
2003
IEEE
14 years 3 months ago
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionalit...
Bong-Jun Ko, Dan Rubenstein
DAGSTUHL
1996
13 years 11 months ago
A Self-Applicable Supercompiler
A supercompiler is a program which can performa deep transformation of programsusing a principle which is similarto partial evaluation, and can be referred to as metacomputation. ...
Andrei P. Nemytykh, Victoria A. Pinchuk, Valentin ...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 10 months ago
Picking up the Pieces: Self-Healing in Reconfigurable Networks
We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity...
Jared Saia, Amitabh Trehan
CIKM
2009
Springer
14 years 4 months ago
Graph classification based on pattern co-occurrence
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
Ning Jin, Calvin Young, Wei Wang
IADIS
2008
13 years 11 months ago
Dagma: Mining Directed Acyclic Graphs
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
T. Werth, A. Dreweke, Marc Wörlein, Ingrid Fi...