Sciweavers

806 search results - page 122 / 162
» Lower Bounds on Correction Networks
Sort
View
WWW
2007
ACM
14 years 11 months ago
Long distance wireless mesh network planning: problem formulation and solution
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
Sayandeep Sen, Bhaskaran Raman
FSTTCS
2003
Springer
14 years 3 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
RTCSA
2007
IEEE
14 years 4 months ago
Virtual Full Replication by Adaptive Segmentation
We propose Virtual Full Replication by Adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication ...
Gunnar Mathiason, Sten F. Andler, Sang Hyuk Son
STACS
2005
Springer
14 years 3 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
ICC
1997
IEEE
108views Communications» more  ICC 1997»
14 years 2 months ago
Overflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
Boris Tsybakov, Nicolas D. Georganas