Sciweavers

74 search results - page 10 / 15
» A Canonical Form for Testing Boolean Function Properties
Sort
View
CORR
2010
Springer
164views Education» more  CORR 2010»
14 years 10 months ago
Is submodularity testable?
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
C. Seshadhri, Jan Vondrák
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 4 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
WOB
2008
128views Bioinformatics» more  WOB 2008»
15 years 1 months ago
Tests for Gene Clusters Satisfying the Generalized Adjacency Criterion
Abstract. We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster....
Ximing Xu, David Sankoff
SIGSOFT
2006
ACM
15 years 5 months ago
Simulation-based test adequacy criteria for distributed systems
Developers of distributed systems routinely construct discrete-event simulations to help understand and evaluate the behavior of inter-component protocols. Simulations are abstrac...
Matthew J. Rutherford, Antonio Carzaniga, Alexande...
SIAMCOMP
2010
94views more  SIAMCOMP 2010»
14 years 10 months ago
Local Monotonicity Reconstruction
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
Michael E. Saks, C. Seshadhri