Sciweavers

1182 search results - page 225 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
CASON
2010
IEEE
12 years 11 months ago
Social Network Reduction Based on Stability
—The analysis of social networks is concentrated especially on uncovering hidden relations and properties of network members (vertices). Most of the current approaches are focuse...
Milos Kudelka, Zdenek Horak, Václav Sn&aacu...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
KBSE
2009
IEEE
14 years 2 months ago
Alattin: Mining Alternative Patterns for Detecting Neglected Conditions
—To improve software quality, static or dynamic verification tools accept programming rules as input and detect their violations in software as defects. As these programming rul...
Suresh Thummalapenta, Tao Xie
WIOPT
2005
IEEE
14 years 1 months ago
A New Hybrid Scheduling Framework for Asymmetric Wireless Environments with Request Repetition
Abstract— The ever-increasing popularity of web services, growing demand for wireless multimedia and introduction of new, feature-enhanced, hand-held devices has already given bi...
Navrati Saxena, Maria Cristina Pinotti, Kalyan Bas...
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
14 years 1 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve