632 search results - page 96 / 127 » On Routing in Circulant Graphs |
IPL
2006
13 years 8 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
NETWORKING
2011
12 years 11 months ago
2011
Abstract. In this paper we introduce Spatio-TEmporal Parametric Stepping (STEPS) - a simple parametric mobility model which can cover a ectrum of human mobility patterns. STEPS mak...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
OPODIS
2004
13 years 9 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...