Sciweavers

20807 search results - page 4159 / 4162
» How to read a paper
Sort
View
PODC
2009
ACM
14 years 8 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
CCR
2005
103views more  CCR 2005»
13 years 7 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
WWW
2007
ACM
14 years 8 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...
SIGCSE
2009
ACM
167views Education» more  SIGCSE 2009»
14 years 8 months ago
Python CS1 as preparation for C++ CS2
How suitable is a Python-based CS1 course as preparation for a C++-based CS2 course? After fifteen years of using C++ for both CS1 and CS2, the Computer Science Department at Mich...
Richard J. Enbody, William F. Punch, Mark McCullen
SOSP
2003
ACM
14 years 4 months ago
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Peer-to-peer (P2P) file sharing accounts for an astonishing volume of current Internet traffic. This paper probes deeply into modern P2P file sharing systems and the forces that...
P. Krishna Gummadi, Richard J. Dunn, Stefan Saroiu...
« Prev « First page 4159 / 4162 Last » Next »