1399 search results - page 64 / 280 » Multi-party Finite Computations |
EJC
2008
13 years 10 months ago
2008
3 Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing 4 algorithms with applications to DNA library screening, DIMACS Series in Discrete Ma...
IPL
2007
13 years 10 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
INFOCOM
2011
IEEE
13 years 1 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....
ICIP
1998
IEEE
14 years 11 months ago
1998
IEEE
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
GI
2010
Springer
13 years 8 months ago
2010
Springer
: In this article, it is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become sub...