Sciweavers

803 search results - page 79 / 161
» Independence in Direct-Product Graphs
Sort
View
LATIN
2010
Springer
15 years 7 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...
102
Voted
AUSDM
2007
Springer
164views Data Mining» more  AUSDM 2007»
15 years 7 months ago
SemGrAM - Integrating Semantic Graphs into Association Rule Mining
To date, most association rule mining algorithms have assumed that the domains of items are either discrete or, in a limited number of cases, hierarchical, categorical or linear. ...
John F. Roddick, Peter Fule
132
Voted
MODELS
2009
Springer
15 years 5 months ago
On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
Hartmut Ehrig, Claudia Ermel, Frank Hermann, Ulrik...
95
Voted
ICCV
2007
IEEE
16 years 2 months ago
A Robust Graph-Based Method for The General Correspondence Problem Demonstrated on Image Stitching
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
Martin Bujnak, Radim Sára
DAC
2007
ACM
16 years 1 months ago
Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
Sander Stuijk, Twan Basten, Marc Geilen, Henk Corp...