Now showing items 1-10 of 81
An analysis of errors in finite automata
(Elsevier, 1965-06)
This paper studies errors in finite automata. An error is defined as a pair of states and errors are then classified according to their probability of being corrected (i.e., being taken into the same state). Various results ...
Depth from relative normal flows
(Elsevier, 1990)
Most of the depth from image flow algorithms has to rely on either good initial guesses, or some assumptions about the object surfaces to achieve solutions that agree with the physical world. Waxman and Sinha point out ...
An algorithm for determining identity of nearest-neighbor and potential function decision rules
(Elsevier, 1980)
The nearest-neighbor and potential function decision rules are nonparametric techniques that partition the feature space based on a set of labelled sample points. Determining whether the partitions of the two rules are ...
A topological characterization of the stable and minimal model classes of propositional logic programs
(Kluwer Academic Publishers; J.C. Baltzer AG, Scientific Publishing Company ; Springer Science+Business Media, 1995-09)
In terms of the arithmetic hierarchy, the complexity of the set of minimal models and of the set of stable models of a propositional general logic program has previously been described. However, not every set of interpretations ...
On the measurement and use of time-varying communication channels
(Elsevier, 1965-08)
In radio, radar, sonar, and seismic signal detection there is often the problem of processing received signals which have been distorted by a linear operation in the process of being transmitted. Examples are scattering ...
DENDRAL: A case study of the first expert system for scientific hypothesis formation
(Elsevier, 1993-06)
The DENDRAL Project was one of the first large-scale programs to embody the strategy of using detailed, task-specific knowledge about a problem domain as a source of heuristics, and to seek generality through automating ...
Nonmonotonic consequences in default domain theory
(Kluwer Academic Publishers; Springer Science+Business Media, 1997-03)
Default domain theory is a framework for representing and reasoning about commonsense knowledge. Although this theory is motivated by ideas in Reiter’s work on default logic, it is in some sense a dual framework. We make ...
Genetic Algorithms and Machine Learning
(Kluwer Academic Publishers-Plenum Publishers; Kluwer Academic Publishers ; Springer Science+Business Media, 1988-10)
On the statistics of random pulse processes
(Elsevier, 1971-05)
Statistics are obtained for pulse trains in which the pulse shapes as well as the time base are random. The general expression derived for the mean and spectral density of the pulse train require neither independence of ...