30 search results - page 3 / 6 » Analyzing the Scalability of Graph Algorithms on Eldorado |
PPOPP
2012
ACM
12 years 3 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
PAKDD
2011
ACM
12 years 10 months ago
2011
ACM
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
IPSN
2004
Springer
14 years 29 days ago
2004
Springer
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...