Sciweavers

67 search results - page 13 / 14
» Bug Classification Using Program Slicing Metrics
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 6 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 6 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
ASPLOS
2008
ACM
13 years 8 months ago
Hardware counter driven on-the-fly request signatures
Today's processors provide a rich source of statistical information on application execution through hardware counters. In this paper, we explore the utilization of these sta...
Kai Shen, Ming Zhong, Sandhya Dwarkadas, Chuanpeng...
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
13 years 7 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
ISSTA
2010
ACM
13 years 6 months ago
Automatically identifying critical input regions and code in applications
Applications that process complex inputs often react in different ways to changes in different regions of the input. Small changes to forgiving regions induce correspondingly smal...
Michael Carbin, Martin C. Rinard