Sciweavers

53 search results - page 2 / 11
» An Empirical Study of Static Call Graph Extractors
Sort
View
ICSM
2009
IEEE
14 years 11 days ago
Incremental call graph reanalysis for AspectJ software
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
Yu Lin, Sai Zhang, Jianjun Zhao
COMSWARE
2008
IEEE
13 years 7 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
ISSRE
2006
IEEE
13 years 11 months ago
Call Stack Coverage for GUI Test-Suite Reduction
—Graphical user interfaces (GUIs) are used as front ends to most of today’s software applications. The event-driven nature of GUIs presents new challenges for testing. One impo...
Scott McMaster, Atif M. Memon
IJON
2010
178views more  IJON 2010»
13 years 4 months ago
An empirical study of two typical locality preserving linear discriminant analysis methods
: Laplacian Linear Discriminant Analysis (LapLDA) and Semi-supervised Discriminant Analysis (SDA) are two recently proposed LDA methods. They are developed independently with the a...
Lishan Qiao, Limei Zhang, Songcan Chen
ICDM
2008
IEEE
117views Data Mining» more  ICDM 2008»
14 years 5 days ago
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs
How do real, weighted graphs change over time? What patterns, if any, do they obey? Earlier studies focus on unweighted graphs, and, with few exceptions, they focus on static snap...
Leman Akoglu, Mary McGlohon, Christos Faloutsos