Sciweavers

916 search results - page 131 / 184
» Using redundancies to find errors
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
15 years 10 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
BMCBI
2007
159views more  BMCBI 2007»
14 years 9 months ago
Detecting differential expression in microarray data: comparison of optimal procedures
Background: Many procedures for finding differentially expressed genes in microarray data are based on classical or modified t-statistics. Due to multiple testing considerations, ...
Elena Perelman, Alexander Ploner, Stefano Calza, Y...
OSDI
2008
ACM
15 years 10 months ago
KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive prog...
Cristian Cadar, Daniel Dunbar, Dawson R. Engler
TSE
2010
180views more  TSE 2010»
14 years 8 months ago
Aspect-Oriented Race Detection in Java
—In the past, researchers have developed specialized programs to aid programmers in detecting concurrent programming errors such as deadlocks, livelocks, starvation, and data rac...
Eric Bodden, Klaus Havelund
SIAMIS
2010
171views more  SIAMIS 2010»
14 years 4 months ago
Global Optimization for One-Dimensional Structure and Motion Problems
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
Olof Enqvist, Fredrik Kahl, Carl Olsson, Kalle &Ar...