Results 211 to 220 of about 3,683 (247)

Sequential estimation with a finite statistic

IEEE Transactions on Information Theory, 1973
A procedure is given for optimizing the sequential estimation of a random variable in the mean-square sense, with the constraint that the data must be summarized by a finite-valued statistic. This finite-valued statistic can be considered to be the memory of the processor.
Koplowitz, Jack, Roberts, Richard A.
openaire   +1 more source

Sequential information bottleneck for finite data

Twenty-first international conference on Machine learning - ICML '04, 2004
The sequential information bottleneck (sIB) algorithm clusters co-occurrence data such as text documents vs. words. We introduce a variant that models sparse co-occurrence data by a generative process. This turns the objective function of sIB, mutual information, into a Bayes factor, while keeping it intact asymptotically, for non-sparse data ...
Jaakko Peltonen, Janne Sinkkonen, Samuel Kaski   +2 more
openaire   +1 more source

Polylinear Sequential Circuit Realizations of Finite Automata

IEEE Transactions on Computers, 1968
Abstract—This paper considers the problem of obtaining realizations of synchronous finite automata from their regular expression specifications. A polylinear sequential circuit realization is defined, and it is proven that every synchronous finite automaton has such a realization.
openaire   +2 more sources

The Wiener Sequential Testing Problem with Finite Horizon

Stochastics and Stochastic Reports, 2004
We present a solution of the Bayesian problem of sequential testing of two simple hypotheses about the mean value of an observed Wiener process on the time interval with finite horizon. The method of proof is based on reducing the initial optimal stopping problem to a parabolic free-boundary problem where the continuation region is determined by two ...
Gapeev, P.V., Peskir, G.
openaire   +3 more sources

Sequential reliability assurance in finite lots

Microelectronics Reliability, 1969
Efficient sequential stopping rules are developed which assure fixed length lower confidence limits on lot reliability when inspection is of the rectifying type. Several models of production processes are defined and analyzed: 1. A nonparametric model 2. Parametric models 3. Parametric models with prior distributions.
openaire   +2 more sources

Unambiguous Automata Denoting Finitely Sequential Functions

2013
The min-plus automata with real weights are interesting both in theory and in practice, e.g. their variants are used as a data structure in speech recognition. In this paper we study automata which are finite unions of deterministic ones, called finitely sequential automata.
Sebastian Bala, Artur Koniński
openaire   +1 more source

Decomposition theorems for finite sequential machines

Israel Journal of Mathematics, 1968
In this work we present a different proof of results by K.B. Krohn and J. L. Rhodes [1], and give a new result on the same lines. These authors proved that every function computed by a finite state machine can be constructed by “elementary operations” on a set of “prime functions.” By extending the scope of elementary operations, we now show that all ...
openaire   +2 more sources

Sequential Networks as Finite State Machines

2018
The term Finite State Machine indicates a regular and standard structure that is able to describe and synthesize sequential networks in a general fashion. Algorithmic State Machine (ASM) is the tool adopted in the book and developed through the chapter. The attention is focused on synchronous stand-alone machines, their properties, and timing behavior.
Giuliano Donzellini, Luca Oneto, Domenico Ponta, Davide Anguita   +3 more
openaire   +1 more source

A Mathematical Model of Finite Random Sequential Automata

IEEE Transactions on Computers, 1968
The sequential logic theory previously advanced[2] is generalized to operations between variables of maximum word length n. Based on the generalized sequential logic operations, a new kind of probability, termed sequential probability, is introduced. By means of sequential probability, a mathematical model can be obtained for finite random sequential ...
Oprescu, Mihai Francisc Anton, Stanciulescu, Florin   +1 more
openaire   +2 more sources

On the Commutativity of Sequential Finite Rotations

International Journal of Mechanical Engineering Education, 2008
Non-commutativity of finite rotations is a fundamental issue that needs to be addressed in mathematical models dealing with sequential finite rotations. Comprehending rotational motions required to orient a rigid link or associated reference frames in a three-dimensional space can be quite challenging for beginning students.
Alamgir A. Choudhury, Mitchel J. Keil, Jorge Rodriguez   +2 more
openaire   +1 more source