Sciweavers

513 search results - page 58 / 103
» Software Components Capture Using Graph Clustering
Sort
View
ICSE
2004
IEEE-ACM
14 years 9 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
JWSR
2007
114views more  JWSR 2007»
13 years 9 months ago
Development of Distance Measures for Process Mining, Discovery and Integration
: Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services h...
Joonsoo Bae, Ling Liu, James Caverlee, Liang-Jie Z...
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 9 months ago
Estimating and Sampling Graphs with Multidimensional Random Walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
Bruno F. Ribeiro, Donald F. Towsley
BMCBI
2007
135views more  BMCBI 2007»
13 years 9 months ago
Measuring similarities between gene expression profiles through new data transformations
Background: Clustering methods are widely used on gene expression data to categorize genes with similar expression profiles. Finding an appropriate (dis)similarity measure is crit...
Kyungpil Kim, Shibo Zhang, Keni Jiang, Li Cai, In-...
JOT
2010
173views more  JOT 2010»
13 years 7 months ago
A Dependence Representation for Coverage Testing of Object-Oriented Programs
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
E. S. F. Najumudheen, Rajib Mall, Debasis Samanta