1830 search results - page 105 / 366 » Workshop on Graph Computation Models |
170
click to vote
APVIS
2007
15 years 7 months ago
2007
In this paper, we introduce a new method, GraphScape, to visualize multivariate networks, i.e., graphs with multivariate data associated with their nodes. GraphScape adopts a land...
167
click to vote
ICCS
2004
Springer
15 years 11 months ago
2004
Springer
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
181
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
201
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
178
click to vote
EDOC
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper studies the following problem: given a pair of business process models, determine which elements in one model are related to which elements in the other model. This prob...