40 search results - page 1 / 8 » On the size of the algebraic difference of two random Cantor... |
RSA
2008
13 years 4 months ago
2008
In this paper we consider some families of random Cantor sets on the line and investigate the question whether the condition that the sum of Hausdorff dimension is larger than one ...
ISCC
2000
IEEE
13 years 9 months ago
2000
IEEE
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are ...
CORR
2000
Springer
13 years 5 months ago
2000
Springer
We consider the adaptation of random early detection (RED) as an active queue management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTU...
PODS
2012
ACM
11 years 7 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
CSDA
2007
13 years 5 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...