Sciweavers

362 search results - page 11 / 73
» Evaluating use of data flow systems for large graph analysis
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ICSM
2005
IEEE
14 years 1 months ago
Towards Employing Use-Cases and Dynamic Analysis to Comprehend Mozilla
This paper presents an approach for comprehending large software systems using views that are created by subjecting the software systems to dynamic analysis under various use-case...
Maher Salah, Spiros Mancoridis, Giuliano Antoniol,...
IPPS
2007
IEEE
14 years 1 months ago
Stack Trace Analysis for Large Scale Debugging
We present the Stack Trace Analysis Tool (STAT) to aid in debugging extreme-scale applications. STAT can reduce problem exploration spaces from thousands of processes to a few by ...
Dorian C. Arnold, Dong H. Ahn, Bronis R. de Supins...
CORR
2002
Springer
156views Education» more  CORR 2002»
13 years 7 months ago
Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design
Despite recent excitement generated by the peer-to-peer (P2P) paradigm and the surprisingly rapid deployment of some P2P applications, there are few quantitative evaluations of P2...
Matei Ripeanu, Ian T. Foster, Adriana Iamnitchi
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 2 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...