Share This Author
Chord: A scalable peer-to-peer lookup service for internet applications
- I. Stoica, R. Morris, David R Karger, M. Kaashoek, H. Balakrishnan
- Computer ScienceSIGCOMM '01
- 1 October 2001
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Chord: a scalable peer-to-peer lookup protocol for internet applications
Results from theoretical analysis and simulations show that Chord is scalable: Communication cost and the state maintained by each node scale logarithmically with the number of Chord nodes.
A Random Linear Network Coding Approach to Multicast
This work presents a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks, and shows that this approach can take advantage of redundant network capacity for improved success probability and robustness.
Wide-area cooperative storage with CFS
The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS…
A scalable location service for geographic ad hoc routing
- Jinyang Li, John Jannotti, D. Couto, David R Karger, R. Morris
- Computer ScienceMobiCom '00
- 1 August 2000
GLS combined with geographic forwarding allows the construction of ad hoc mobile networks that scale to a larger number of nodes than possible with previous work, and compares favorably with Dynamic Source Routing.
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
- David R Karger, E. Lehman, F. Leighton, R. Panigrahy, Matthew S. Levine, D. Lewin
- Computer ScienceSTOC '97
- 4 May 1997
A family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network, based on a special kind of hashing that is called consistent hashing.
Tackling the Poor Assumptions of Naive Bayes Text Classifiers
This paper proposes simple, heuristic solutions to some of the problems with Naive Bayes classifiers, addressing both systemic issues as well as problems that arise because text is not actually generated according to a multinomial model.
Using linear programming to Decode Binary linear codes
- J. Feldman, M. Wainwright, David R Karger
- Computer ScienceIEEE Transactions on Information Theory
- 1 March 2005
The definition of a pseudocodeword unifies other such notions known for iterative algorithms, including "stopping sets," "irreducible closed walks," "trellis cycles," "deviation sets," and "graph covers," which is a lower bound on the classical distance.
Scatter/Gather: a cluster-based approach to browsing large document collections
This work presents a document browsing technique that employs document clustering as its primary operation, and presents fast (linear time) clustering algorithms which support this interactive browsing paradigm.
Soylent: a word processor with a crowd inside
S soylent, a word processing interface that enables writers to call on Mechanical Turk workers to shorten, proofread, and otherwise edit parts of their documents on demand, and the Find-Fix-Verify crowd programming pattern, which splits tasks into a series of generation and review stages.