1399 search results - page 191 / 280 » Multi-party Finite Computations |
143
click to vote
COMCOM
1998
15 years 4 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...
122
Voted
FMSD
1998
15 years 4 months ago
1998
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...
168
Voted
NN
2002
Springer
2002
Springer
Optimal design of regularization term and regularization parameter by subspace information criterion
15 years 4 months ago
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
112
click to vote
TIT
2002
15 years 4 months ago
2002
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
126
Voted
TOG
2002
15 years 4 months ago
2002
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...