5056 search results - page 490 / 1012 » Network Coding Theory |
138
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
128
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
182
Voted
PODS
2006
ACM
16 years 5 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
128
click to vote
ICFP
2005
ACM
16 years 5 months ago
2005
ACM
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
136
click to vote
CAV
2009
Springer
15 years 12 months ago
2009
Springer
Systems and Networks on Chips (NoCs) are a prime design focus of many hardware manufacturers. In addition to functional verification, which is a difficult necessity, the chip desi...