Statistical information about the flow sizes in the traffic passing through a network link helps a network operator to characterize network resource usage, infer traffic demands,...
Abhishek Kumar, Minho Sung, Jun Xu, Ellen W. Zegur...
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Recent research in embedded computing indicates that packing multiple processor cores on the same die is an effective way of utilizing the ever-increasing number of transistors. T...
— Access control in computational grids is typically provided by a combination of identity certificates and local accounts. This approach does not scale as the number of users a...
Tatyana Ryutov, Li Zhou, B. Clifford Neuman, Noria...
— Jobs on the Grid require security credentials throughout their run for accessing secure Grid resources, such as GridFTP data repositories. However, delegating long-lived creden...