A profiling adversary is an adversary whose goal is to classify a population of users into categories according to messages they exchange. This adversary models the most common pr...
Aleksandra Korolova, Ayman Farahat, Philippe Golle
A variant of the k-nearest neighbor algorithm is proposed for image interpolation. Instead of using a static volume or static k, the proposed algorithm determines a dynamic k that...
The Data-Flow Graph (DFG) of a parallel application is frequently used to take scheduling decisions, based on the information that it models (dependencies among the tasks and volu...
Rafael Ennes Silva, Guilherme P. Pezzi, Nicolas Ma...
Abstract--With the growing computer networks, accessible data is becoming increasing distributed. Understanding and integrating remote and unfamiliar data sources are important dat...
Abstract—We introduce a rate-based congestion control mechanism for Content-Centric Networking (CCN). It builds on the fact that one Interest retrieves at most one Data packet. C...