By Topic

IEEE Transactions on Computers

Issue 1 • Date Jan. 1973

Filter Results

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

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

    Publication Year: 1973, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (214 KB)
    Freely Available from IEEE
  • A Change in Editorial Policy for Transactions Papers and Abstracts

    Publication Year: 1973, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (136 KB)
    Freely Available from IEEE
  • On the Parallel Evaluation of Polynomials

    Publication Year: 1973, Page(s):2 - 5
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    If an unlimited number of processors is available, then for any given number of steps s, s≥1, polynomials of degree as large as C2n-δcan be evaluated, where C= √2 and δ ≈ √2s. This implies polynomials of degree can be evaluated in log2n+√2log2n +0(1) steps. Various techniques for the evaluation of polynomials in a "reasonable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Correction in Redundant Residue Number Systems

    Publication Year: 1973, Page(s):5 - 11
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2552 KB)

    Two error-correcting algorithms for redundant residue number systems are presented, one for single residue-error correction and the other for burst residue-error correction. Neither algorithm requires table lookup, and hence their implementation needs a memory space which is much smaller than that required by existing methods. Furthermore, the conditions which the moduli of the redundant residue n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time Bounds on Space Computations

    Publication Year: 1973, Page(s):12 - 17
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2080 KB)

    A physicomathematical basis is used to establish bounds TD(n) on the time needed to compute n-argument functions by spatially distributed primitive devices or composite systems D. The axioms used concern the speed, packing density, and noise threshold of the energy with which any computing device detects or alters the physical representation of information. The principal result is that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Reconstruction of Three-Dimensional Objects from Two Orthogonal Projections and its Application to Cardiac Cineangiography

    Publication Year: 1973, Page(s):18 - 28
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5720 KB)

    A method is developed for the reconstruction of a two-dimensional convex symmetric object from two orthogonal projections. To reconstruct a three-dimensional object, the object is divided into thin slices and the slices are individually reconstructed. An experimental result of the reconstruction of a clay model from its X-ray pictures is described. Applicability of this technique to cardiac cinean... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Two-Space Solution to the Hidden Line Problem for Plotting Functions of Two Variables

    Publication Year: 1973, Page(s):28 - 33
    Cited by:  Papers (11)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3200 KB)

    A fast algorithm for eliminating hidden linies from perspective representations of single-valued functions of two variables is presented. Compared with the most widely used algorithm for this problem, the algorithm presented here is as versatile, but much faster. Compared with a recently published algorithm for this problem, the algorithm presented here is more powerful and as fast. Compared with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Computation of Window Operations on a Parallel Organized Computer—A Case Study

    Publication Year: 1973, Page(s):34 - 40
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    The computation of window operations and arbitrary local operations on a parallel organized computer is studied. It is shown that for the window operations, the computation time can be minimized, subject to the restriction of memory accessibility. It is also shown that the computation time increases as the degree of disorderliness of a local operation increases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Digital Differential Analyzer with Arbitrary Stored Interconnections

    Publication Year: 1973, Page(s):41 - 46
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2256 KB)

    DRO associative memory, as well as NDRO associative memory, is used for realizing an arbitrary stored interconnection address system and the increment store of a parallel-type DDA. An MFMU is used also for realizing a parallel-type DDA with an arbitary stored interconnection system. In this system each memory cell represents an integrator with its address codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing Testability of Large-Scale Integrated Circuits via Test Points and Additional Logic

    Publication Year: 1973, Page(s):46 - 60
    Cited by:  Papers (160)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5160 KB)

    With the increasing complexity of logic that can be fabricated on a single large-scale integrated (LSI) circuit chip, there is a growing problem of checking the logical behavior of the chips at manufacture. The problem is particularly acute for sequential circuits, where there are difficulties in setting and checking the state of the system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital and Hybrid Computational Aspects of the Discrete Representation Theorem of Nonlinear Estimation

    Publication Year: 1973, Page(s):61 - 67
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2440 KB)

    A nonlinear filtering problem is investigated, and the discrete representation theorem is used to synthesize the optimal filter. An optimal filtering algorithm is described, and hybrid techniques are employed to effect several methods of implementing the algorithm on a hybrid computer. These implementations are then compared (via Monte Carlo analysis) on the bases of speed and accuracy. It is conc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Representation and Matching of Pictorial Structures

    Publication Year: 1973, Page(s):67 - 92
    Cited by:  Papers (260)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7032 KB)

    The primary problem dealt with in this paper is the following. Given some description of a visual object, find that object in an actual photograph. Part of the solution to this problem is the specification of a descriptive scheme, and a metric on which to base the decision of "goodness" of matching or detection. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees

    Publication Year: 1973, Page(s):93 - 103
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2672 KB)

    The efficient partitioning of a finite-dimensional space by a decision tree, each node of which corresponds to a comparison involving a single variable, is a problem occurring in pattern classification, piecewise-constant approximation, and in the efficient programming of decision trees. A two-stage algorithm is proposed. The first stage obtains a sufficient partition suboptimally, either by metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complex Disjunctive Decomposition of Incompletely Specified Boolean Functions

    Publication Year: 1973, Page(s):103 - 110
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3704 KB)

    In this paper the Ashenhurst-Curtis theory of complex disjunctive decompositions is extended to the realm of incompletely specified Boolean functions. A compatibility relation on the column vectors of the decomposition chart is introduced, which is applied to identify all possible simple disjunctive decompositions for each input partition. The assignments of the DON'T CARE (φ) conditions that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Application of Filtered Transforms to the General Classification Problem"

    Publication Year: 1973, Page(s): 111
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Printing of Octal Numerals

    Publication Year: 1973, Page(s): 111
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Although the conversion from octal to binary is a trivially simple process, it is still somewhat trying to have to mentally perform the conversion when reading a long list of octal numbers. The problem becomes especially annoying when one is examining the memory dump of the word contents of a machine which has a byte size not divisible by three (e.g., PDP-11). In such cases some of the octal digit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B73-1 An Introduction to Cobol Programming

    Publication Year: 1973, Page(s): 112
    Request permission for commercial reuse | PDF file iconPDF (264 KB)
    Freely Available from IEEE
  • B73-2 Approximate Calculation of Multiple Integrals

    Publication Year: 1973, Page(s): 112
    Request permission for commercial reuse | PDF file iconPDF (264 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1973, Page(s): 112
    Request permission for commercial reuse | PDF file iconPDF (408 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1973, Page(s): 112
    Request permission for commercial reuse | PDF file iconPDF (27 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