Sciweavers

362 search results - page 22 / 73
» Evaluating use of data flow systems for large graph analysis
Sort
View
DSN
2002
IEEE
14 years 19 days ago
Pinpoint: Problem Determination in Large, Dynamic Internet Services
Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today’s large, distributed, and dynamic application e...
Mike Y. Chen, Emre Kiciman, Eugene Fratkin, Armand...
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
14 years 8 months ago
SNARE: a link analytic system for graph labeling and risk detection
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
KBSE
1999
IEEE
13 years 12 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
BMCBI
2008
125views more  BMCBI 2008»
13 years 7 months ago
SNPLims: a data management system for genome wide association studies
Background: Recent progresses in genotyping technologies allow the generation high-density genetic maps using hundreds of thousands of genetic markers for each DNA sample. The ava...
Alessandro Orro, Guia Guffanti, Erika Salvi, Fabio...
CMSB
2006
Springer
13 years 11 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti