423 search results - page 35 / 85 » Topology for Distributed Inference on Graphs |
ESWS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
102
click to vote
STOC
2009
ACM
16 years 14 days ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
106
click to vote
SIGMETRICS
2003
ACM
15 years 5 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
111
click to vote
MOBIHOC
2001
ACM
15 years 11 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...