Sciweavers

945 search results - page 83 / 189
» Working the Flow
Sort
View
CCR
2008
94views more  CCR 2008»
13 years 10 months ago
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
Xenofontas A. Dimitropoulos, Paul Hurley, Andreas ...
IGPL
2002
91views more  IGPL 2002»
13 years 10 months ago
The Unrestricted Combination of Temporal Logic Systems
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
Marcelo Finger, M. Angela Weiss
ICFP
2003
ACM
14 years 10 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
MOBISYS
2006
ACM
14 years 9 months ago
Measurement driven deployment of a two-tier urban mesh access network
Multihop wireless mesh networks can provide Internet access over a wide area with minimal infrastructure expenditure. In this work, we present a measurement driven deployment stra...
Joseph Camp, Joshua Robinson, Christopher Steger, ...
MSWIM
2005
ACM
14 years 3 months ago
Adaptive transmission opportunity with admission control for IEEE 802.11e networks
The increase of IEEE 802.11’s bandwidth led to a deployment of many multimedia applications over wireless networks. Nevertheless, these applications impose stringent constraints...
Adlen Ksentini, Abdelhak Guéroui, Mohamed N...