Sciweavers

1492 search results - page 18 / 299
» Testing Properties of Constraint-Graphs
Sort
View
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
16 years 1 days ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
IANDC
2006
117views more  IANDC 2006»
14 years 11 months ago
Statistical probabilistic model checking with a focus on time-bounded properties
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
Håkan L. S. Younes, Reid G. Simmons
MA
2011
Springer
220views Communications» more  MA 2011»
14 years 6 months ago
Asymptotic expansions for a class of tests for a general covariance structure under a local alternative
Let S be a p × p random matrix having a Wishart distribution Wp(n, n−1Σ). For testing a general covariance structure Σ = Σ(ξ), we consider a class of test statistics Th = n...
Hiroaki Shimizu, Hirofumi Wakaki
TSE
2011
145views more  TSE 2011»
14 years 6 months ago
Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging
— We present an integrated method for program proving, testing, and debugging. Using the concept of metamorphic relations, we select necessary properties for target programs. For...
Tsong Yueh Chen, T. H. Tse, Zhiquan Zhou
ICASSP
2010
IEEE
14 years 6 months ago
Statistical hypothesis testing with time-frequency surrogates to check signal stationarity
An operational framework is developed for testing stationarity relatively to an observation scale. The proposed method makes use of a family of stationary surrogates for defining ...
Cédric Richard, André Ferrari, Hassa...