Sciweavers

2004 search results - page 391 / 401
» Sampling from large graphs
Sort
View
SIGSOFT
2007
ACM
14 years 10 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
WWW
2008
ACM
14 years 10 months ago
IRLbot: scaling to 6 billion pages and beyond
This paper shares our experience in designing a web crawler that can download billions of pages using a single-server implementation and models its performance. We show that with ...
Hsin-Tsang Lee, Derek Leonard, Xiaoming Wang, Dmit...
VLDB
2008
ACM
170views Database» more  VLDB 2008»
14 years 10 months ago
A layered framework supporting personal information integration and application design for the semantic desktop
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...
Isabel F. Cruz, Huiyong Xiao
MOBIHOC
2007
ACM
14 years 9 months ago
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
Michele Garetto, Paolo Giaccone, Emilio Leonardi
PLDI
2010
ACM
14 years 7 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer