Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 4 • April 1977

Filter Results

Displaying Results 1 - 17 of 17
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1977, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (383 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1977, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (218 KB)
    Freely Available from IEEE
  • Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units

    Publication Year: 1977, Page(s):321 - 328
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2389 KB)

    We consider an abstract partitioning problem which has applications to the design of standard libraries of multipurpose units (such as multi-purpose circuit cards) and to storage allocation in the presence of users with conflicting demands. Although the general problem of finding minimum cost partitions appears to be very difficult, we describe a dynamic programming approach which can be quite eff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing Random Number Generators by Walsh Transform

    Publication Year: 1977, Page(s):329 - 333
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1928 KB)

    A truly random sequence of numbers has an asymptotically flat Walsh power spectrum. This fact is used to devise a new test for the randomness of the output of random number generators. Because it takes little computing time to obtain the Walsh power spectrum of even very long sequences, generators with large periods can be tested. Some computed examples are shown. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Fault Diagnosis in Combinational Networks

    Publication Year: 1977, Page(s):334 - 342
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2634 KB)

    The problem considered in this paper is that of generating sequential decision trees (SDT's) for fault diagnosis in digital combinational networks. Since in most applications of the decision tree the final conclusion will be that the network is failure-free, we are interested mainly in decision trees containing minimal fault detection paths. Such a procedure will reduce the cost of verifying the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Semicausal Model for Recursive Filtering of Two-Dimensional Images

    Publication Year: 1977, Page(s):343 - 350
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4390 KB)

    A two-dimensional discrete stochastic model for representing images is developed. This representation has lower mean square error, compared to a standard autoregressive Markov representation. Application of the model to linear filtering of images degraded by white noise leads to scalar recursive filtering equations requiring only 0(N2log2N) computations for N x N images. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Entropy Image Reconstruction

    Publication Year: 1977, Page(s):351 - 364
    Cited by:  Papers (153)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3786 KB)

    Two-dimensional digital image reconstruction is an important imaging process in many of the physical sciences. If the data are insufficient to specify a unique reconstruction, an additional criterion must be introduced, either implicitly or explicitly before the best estimate can be computed. Here we use a principle of maximum entropy, which has proven useful in other contexts, to design a procedu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree Realizations of Iterative Circuits

    Publication Year: 1977, Page(s):365 - 383
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2510 KB)

    It is shown how any combinational function that can be described by a flow table—or equivalently—is realizable in iterative form—can be realized in tree form. The propagation delay is then proportional to the logarithm of n, the number of inputs, while the logic complexity is a linear function of n. These results are related to various implementations of high-speed binary adders ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Stage Template Matching

    Publication Year: 1977, Page(s):384 - 393
    Cited by:  Papers (104)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2684 KB)

    The computational cost of template matching can be reduced by using only a subtemplate, and applying the rest of the template only when the subtemplate's degree of match exceeds a threshold. A probabilistic analysis of this approach is given, with emphasis on the choice of subtemplate size to minimize the expected computational cost. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Application of Relaxation Labeling to Line and Curve Enhancement

    Publication Year: 1977, Page(s):394 - 403
    Cited by:  Papers (116)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7508 KB)

    A relaxation process is described and is applied to the detection of smooth lines and curves in noisy, real world images. There are nine labels associated with each image point, eight labels indicating line segments at various orientations and one indicating the no-line case. Attached to each label is a probability. In the relaxation process, interaction takes place among the probabilities at neig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Recursive Partitioning Decision Rule for Nonparametric Classification

    Publication Year: 1977, Page(s):404 - 408
    Cited by:  Papers (154)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1307 KB)

    A new criterion for deriving a recursive partitioning decision rule for nonparametric classification is presented. The criterion is both conceptually and computationally simple, and can be shown to have strong statistical merit. The resulting decision rule is asymptotically Bayes' risk efficient. The notion of adaptively generated features is introduced and methods are presented for dealing with m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Max-Min Measure for Image Texture Analysis

    Publication Year: 1977, Page(s):408 - 414
    Cited by:  Papers (50)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1899 KB)

    A new technique for image texture analysis is described which uses the relative frequency of local extremes in grey level as the principal measure. This method is invariant to multiplicative gain changes (such as caused by changes in illumination level or film processing) and is invariant to image resolution and sampling rate if the image is not undersampled. The algorithm described is computation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Testing Random Access Memories

    Publication Year: 1977, Page(s):414 - 416
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    This correspondence presents an optimal algorithm to detect any single stuck-at-1 (s-a-1), stuck-at-0 (s-a-0) fault in a random access memory using only the n-bit memory address register input and m-bit memory buffer register input and output lines. It is shown that this algorithm requires 4 X 2nmemory accesses. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Least Mean Squares CUBIC Algorithm for On-Line Differential of Sampled Analog Signals"

    Publication Year: 1977, Page(s): 416
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (105 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's reply2

    Publication Year: 1977, Page(s): 416
    Request permission for commercial reuse | PDF file iconPDF (105 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

    Publication Year: 1977, Page(s): 416
    Request permission for commercial reuse | PDF file iconPDF (130 KB)
    Freely Available from IEEE
  • Papers to be Published in the Next Issue May 1977

    Publication Year: 1977, Page(s): 416
    Request permission for commercial reuse | PDF file iconPDF (339 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org