1830 search results - page 228 / 366 » Workshop on Graph Computation Models |
128
click to vote
ICPR
2008
IEEE
16 years 21 days ago
2008
IEEE
Traditional stereo algorithms estimate disparity at the same resolution as the observations. In this work we address the problem of estimating disparity and occlusion information ...
154
click to vote
COORDINATION
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
159
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
is an abstract graph reduction machine for the implementation of lazy functional languages. Categorical multi-combinators served as a basis for the evaluation model of µΓCMC. Th...
156
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
132
click to vote
CHI
1994
ACM
15 years 10 months ago
1994
ACM
This paper introduces multitrees, a new type of structure for representing information. Multitrees are a class of directed acyclic graphs (DAGs) with the unusual property that the...