Sciweavers

195 search results - page 7 / 39
» Cluster-based find and replace
Sort
View
INFOCOM
2002
IEEE
13 years 11 months ago
Using the Small-World Model to Improve Freenet Performance
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
JUCS
2002
163views more  JUCS 2002»
13 years 6 months ago
Finding Plagiarisms among a Set of Programs with JPlag
: JPlag is a web service that finds pairs of similar programs among a given set of programs. It has successfully been used in practice for detecting plagiarisms among student Java ...
Lutz Prechelt, Guido Malpohl, Michael Philippsen
ICWSM
2010
13 years 8 months ago
Who Acquires Friends Through Social Media and Why? "Rich Get Richer" Versus "Seek and Ye Shall Find"
There is an ongoing debate, not just among academics but in popular culture, about whether social media can expand people's social networks, and whether online friends can be...
Zeynep Tufekci
OOPSLA
2004
Springer
14 years 1 days ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
DFT
2009
IEEE
106views VLSI» more  DFT 2009»
14 years 1 months ago
Reducing Test Point Area for BIST through Greater Use of Functional Flip-Flops to Drive Control Points
Recently, a new test point insertion method for pseudo-random built-in self-test (BIST) was proposed in [Yang 09] which tries to use functional flip-flops to drive control test po...
Joon-Sung Yang, Benoit Nadeau-Dostie, Nur A. Touba