Sciweavers

4009 search results - page 417 / 802
» Clustering on Complex Graphs
Sort
View
165
Voted
ISSS
1998
IEEE
104views Hardware» more  ISSS 1998»
15 years 11 months ago
Synchronization Detection for Multi-Process Hierarchical Synthesis
Complex system specifications are often hierarchically composed of several subsystems. Each subsystem contains one or more processes. In order to provide optimization across diffe...
Oliver Bringmann, Wolfgang Rosenstiel, Dirk Reicha...
PODC
2010
ACM
15 years 10 months ago
Brief announcement: tree decomposition for faster concurrent data structures
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
Johannes Schneider, Roger Wattenhofer
DILS
2006
Springer
15 years 10 months ago
On Querying OBO Ontologies Using a DAG Pattern Query Language
The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies that are structured like directed acyclic graphs. In this paper we present a language...
Amarnath Gupta, Simone Santini
FLAIRS
2006
15 years 8 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
IJCAI
2001
15 years 8 months ago
Adaptive Control of Acyclic Progressive Processing Task Structures
The progressive processing model allows a system to trade off resource consumption against the quality of the outcome by mapping each activity to a graph of potential solution met...
Stéphane Cardon, Abdel-Illah Mouaddib, Shlo...