1830 search results - page 66 / 366 » Workshop on Graph Computation Models |
128
click to vote
OPODIS
2008
15 years 5 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
141
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
172
click to vote
PODC
2012
ACM
13 years 6 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
116
click to vote
DIS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
125
Voted
GG
2004
Springer
15 years 9 months ago
2004
Springer
In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these g...