184 search results - page 25 / 37 » A New Algorithm of Constructing the Basis Finite Automaton |
DAM
2006
13 years 8 months ago
2006
The question if there exist nonnormal bent functions was an open question for several years. A Boolean function in n variables is called normal if there exists an affine subspace ...
COMCOM
1998
13 years 8 months ago
1998
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
IJCAI
1989
13 years 9 months ago
1989
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an observer, yet (2) ensuring traceab...