1830 search results - page 83 / 366 » Workshop on Graph Computation Models |
123
click to vote
ENTCS
2007
15 years 4 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
130
click to vote
CGF
1999
15 years 4 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
144
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
When an image is viewed at varying resolutions, it is known to create discrete perceptual jumps or transitions amid the continuous intensity changes. In this paper, we study a per...
131
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
107
click to vote
CAISE
2004
Springer
15 years 9 months ago
2004
Springer
In UML2.0, significant efforts have been devoted towards a better definition of OCL. Still, the adoption of the language by the software engineers remains a significant challenge....