Sciweavers

21324 search results - page 135 / 4265
» Making the case for computing
Sort
View
102
Voted
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 8 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
96
Voted
IPTPS
2004
Springer
15 years 8 months ago
Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning
—This paper discusses large scale keyword searching on top of peer-to-peer (P2P) networks. The state-of-the-art keyword searching techniques for unstructured and structured P2P s...
Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu,...
121
Voted
SIGCOMM
2003
ACM
15 years 7 months ago
Making gnutella-like P2P systems scalable
Napster pioneered the idea of peer-to-peer file sharing, and supported it with a centralized file search facility. Subsequent P2P systems like Gnutella adopted decentralized sea...
Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nic...
ADAEUROPE
2010
Springer
15 years 7 months ago
What to Make of Multicore Processors for Reliable Real-Time Systems?
Now that multicore microprocessors have become a commodity, it is natural to think about employing them in all kinds of computing, including high-reliability embedded real-time sy...
Theodore P. Baker
CHI
2009
ACM
15 years 7 months ago
Make new friends, but keep the old: recommending people on social networking sites
This paper studies people recommendations designed to help users find known, offline contacts and discover new friends on social networking sites. We evaluated four recommender al...
Jilin Chen, Werner Geyer, Casey Dugan, Michael J. ...