1830 search results - page 181 / 366 » Workshop on Graph Computation Models |
140
click to vote
ICS
2010
Tsinghua U.
16 years 2 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
121
click to vote
JSSPP
2009
Springer
15 years 11 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...
173
click to vote
AGTIVE
2003
Springer
15 years 10 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
176
Voted
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
145
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...