Sciweavers

352 search results - page 55 / 71
» Fast Graph Pattern Matching
Sort
View
HPDC
2010
IEEE
13 years 8 months ago
LogGOPSim: simulating large-scale applications in the LogGOPS model
We introduce LogGOPSim--a fast simulation framework for parallel algorithms at large-scale. LogGOPSim utilizes a slightly extended version of the well-known LogGPS model in combin...
Torsten Hoefler, Timo Schneider, Andrew Lumsdaine
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...
JMLR
2010
157views more  JMLR 2010»
13 years 6 months ago
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
HPDC
1998
IEEE
13 years 11 months ago
Adaptive Communication Algorithms for Distributed Heterogeneous Systems
Heterogeneous network-based systems are emerging as attractive computing platforms for HPC applications. This paper discusses fundamental research issues that must be addressed to...
Prashanth B. Bhat, Viktor K. Prasanna, Cauligi S. ...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals