We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
Background: Recently several statistical methods have been proposed to identify genes with differential expression between two conditions. However, very few studies consider the p...
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
W e investigate packet discarding schemes for TCP over ATM with UBR service. In doing so, we tested the eflective throughput of two existing schemes, Partial Pnwlcet Discard(PPD) ...