Sciweavers

419 search results - page 7 / 84
» Constraint models for graceful graphs
Sort
View
DICS
2006
13 years 11 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch
AGTIVE
2007
Springer
13 years 11 months ago
Verification and Synthesis of OCL Constraints Via Topology Analysis
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
Jörg Bauer, Werner Damm, Tobe Toben, Bernd We...
IEEEPACT
2003
IEEE
14 years 20 days ago
Constraint Graph Analysis of Multithreaded Programs
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
Harold W. Cain, Mikko H. Lipasti, Ravi Nair
MTSR
2007
Springer
14 years 1 months ago
Formalizing Dublin Core Application Profiles - Description Set Profiles and Graph Constraints
Abstract. This paper describes a proposed formalization of the notion of Applications Profiles as used in the Dublin Core community. The formalization, called Description Set Profi...
Mikael Nilsson, Alistair J. Miles, Pete Johnston, ...
ICPR
2008
IEEE
14 years 1 months ago
Video object segmentation based on graph cut with dynamic shape prior constraint
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
Peng Tang, Lin Gao