1274 search results - page 108 / 255 » Graph lambda theories |
KDD
2008
ACM
14 years 9 months ago
2008
ACM
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
WSDM
2010
ACM
14 years 6 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
TLDI
2009
ACM
14 years 5 months ago
2009
ACM
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
SAC
2009
ACM
14 years 3 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
SMA
2003
ACM
14 years 2 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...