4 search results - page 1 / 1 » A probabilistic algorithm to test local algebraic observabil... |
ISSAC
2001
Springer
13 years 9 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
IPL
2007
13 years 4 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...