Sciweavers

2076 search results - page 280 / 416
» Universal Routing in Distributed Networks
Sort
View
124
Voted
MWCN
2004
Springer
15 years 9 months ago
The Receiver's Dilemma
In Mobile Ad Hoc Networks (MANETs), each node has the capacity to act as a router. The performance of the MANET relies on how well the nodes perform this function. In simulations,...
John P. Mullen, Timothy Matis, Smriti Rangan
132
Voted
CORR
2011
Springer
183views Education» more  CORR 2011»
14 years 10 months ago
Automatic Network Fingerprinting through Single-Node Motifs
Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs—...
Christoph Echtermeyer, Luciano da Fontoura Costa, ...
146
Voted
SPAA
2004
ACM
15 years 9 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
114
Voted
WWW
2010
ACM
15 years 10 months ago
Mind the data skew: distributed inferencing by speeddating in elastic regions
Semantic Web data exhibits very skewed frequency distributions among terms. Efficient large-scale distributed reasoning methods should maintain load-balance in the face of such hi...
Spyros Kotoulas, Eyal Oren, Frank van Harmelen
137
Voted
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
15 years 8 months ago
Conductance and congestion in power law graphs
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...
Christos Gkantsidis, Milena Mihail, Amin Saberi