Sciweavers

1241 search results - page 33 / 249
» Path-oriented random testing
Sort
View
FSTTCS
2010
Springer
14 years 9 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet
87
Voted
ACL
2009
14 years 9 months ago
Learning with Annotation Noise
It is usually assumed that the kind of noise existing in annotated data is random classification noise. Yet there is evidence that differences between annotators are not always ra...
Eyal Beigman, Beata Beigman Klebanov
94
Voted
SIAMSC
2010
134views more  SIAMSC 2010»
14 years 10 months ago
Moving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
Michael Carley
PLDI
2011
ACM
14 years 2 months ago
Finding and understanding bugs in C compilers
Compilers should be correct. To improve the quality of C compilers, we created Csmith, a randomized test-case generation tool, and spent three years using it to find compiler bug...
Xuejun Yang, Yang Chen, Eric Eide, John Regehr
83
Voted
ALT
2008
Springer
15 years 8 months ago
Nonparametric Independence Tests: Space Partitioning and Kernel Approaches
Abstract. Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-...
Arthur Gretton, László Györfi