—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide ...
Current computational trust models are usually built either on an agent's direct experience of an interaction partner (interaction trust) or reports provided by third parties...
Trung Dong Huynh, Nicholas R. Jennings, Nigel R. S...
Despite the potential of domain ontologies to provide consensual representations of domain-relevant knowledge, the open, distributed and decentralized nature of the Semantic Web me...
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...