164 search results - page 14 / 33 » Formal testing from timed finite state machines |
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we present a novel reversible watermarking scheme for image authentication for JPEG/JPEG-2000 coded images. Since the watermarking scheme is reversible, the exact o...
COLT
1995
Springer
13 years 11 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
FAC
2008
2008
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
13 years 7 months ago
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of th...
IJCAI
2003
13 years 9 months ago
2003
We address the problem of optimally controlling stochastic environments that are partially observable. The standard method for tackling such problems is to define and solve a Part...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....