1262 search results - page 61 / 253 » Fast Robust Hashing |
131
Voted
SIGIR
2008
ACM
15 years 21 days ago
2008
ACM
Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching sig...
106
Voted
TKDE
2008
15 years 20 days ago
2008
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
142
click to vote
NOMS
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
191
Voted
ASPLOS
2011
ACM
14 years 4 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
102
click to vote
ICDCS
2010
IEEE
15 years 4 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...