Sciweavers

1538 search results - page 190 / 308
» Relative Randomness and Cardinality
Sort
View
SAC
2006
ACM
15 years 3 months ago
Trust-decisions on the base of maximal information of recommended direct-trust
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
Uwe Roth, Volker Fusenig
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
15 years 3 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 3 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
ADAEUROPE
2003
Springer
15 years 3 months ago
Charles: A Data Structure Library for Ada95
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...
Matthew Heaney
PROVSEC
2009
Springer
15 years 2 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo