Sciweavers

1425 search results - page 272 / 285
» Beyond Dependency Graphs
Sort
View
CONCUR
2009
Springer
14 years 2 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
DFG
2009
Springer
14 years 2 months ago
Group-Level Analysis and Visualization of Social Networks
Social network analysis investigates the structure of relations amongst social actors. A general approach to detect patterns of interaction and to filter out irregularities is to ...
Michael Baur, Ulrik Brandes, Jürgen Lerner, D...
ISMM
2009
Springer
14 years 2 months ago
Discrete Driver Assistance
Applying computer technology, such as computer vision in driver assistance, implies that processes and data are modeled as being discretized rather than being continuous. The area ...
Reinhard Klette, Ruyi Jiang, Sandino Morales, Tobi...
IWCIA
2009
Springer
14 years 2 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
14 years 2 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt