Sciweavers

126 search results - page 18 / 26
» A Probabilistic Method for Detecting Anomalous Program Behav...
Sort
View
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 9 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
PLDI
2004
ACM
14 years 24 days ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
IPPS
1998
IEEE
13 years 11 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
ICTIR
2009
Springer
14 years 1 months ago
Modeling Expected Utility of Multi-session Information Distillation
Abstract. An open challenge in information distillation is the evaluation and optimization of the utility of ranked lists with respect to flexible user interactions over multiple ...
Yiming Yang, Abhimanyu Lad
ISSTA
2006
ACM
14 years 1 months ago
DSD-Crasher: a hybrid analysis tool for bug finding
DSD-Crasher is a bug finding tool that follows a three-step approach to program analysis: D. Capture the program’s intended execution behavior with dynamic invariant detection....
Christoph Csallner, Yannis Smaragdakis