Sciweavers

2125 search results - page 178 / 425
» On Graph Complexity
Sort
View
ICDE
2001
IEEE
159views Database» more  ICDE 2001»
16 years 4 months ago
Workflow and Process Synchronization with Interaction Expressions and Graphs
Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. W...
Christian Heinlein
CP
2009
Springer
16 years 3 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
PODC
2009
ACM
16 years 3 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
INFOCOM
2009
IEEE
15 years 9 months ago
Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
Guang Tan, Marin Bertier, Anne-Marie Kermarrec
WCNC
2008
IEEE
15 years 9 months ago
Decoding on Graphs: LDPC-Coded MISO Systems and Belief Propagation
— This paper proposes a new approach for decoding LDPC codes over MISO channels. Since in an nT × 1 MISO system with a modulation of alphabet size 2M, nT transmitted symbols are...
Amir H. Djahanshahi, Paul H. Siegel, Laurence B. M...