The Community for Technology Leaders
Green Image
TABLE OF CONTENTS
Issue No. 01 - January (vol. 27)
ISSN: 0018-9340
Papers

IEEE Computer Society (PDF)

pp. c2

A Restructurable Computer System (Abstract)

S.S. Reddi , W. W. Gaertner Research, Inc.
pp. 1-20

Inner Product Computers (Abstract)

E.E., Jr. Swartzlander , TRW Defense and Space Systems Group
pp. 21-31

A Decision Theory Approach to Picture Smoothing (PDF)

M. Kanefsky , Department of Electrical Engineering, University of Pittsburgh
pp. 32-36

Generation of Optimal Transition Count Tests (Abstract)

J.P. Hayes , Department of Electrical Engineering and the Department of Computer Science, University of Southern California
pp. 36-41

On Some Dynamical Properties of Finite Cellular Automaton (Abstract)

M. Harao , Research Institute of Electrical Communication, Tohoku University
pp. 42-52

Universal Modular Trees: A Design Procedure (Abstract)

R.A. Thompson , Department of Electrical Engineering, Virginia Polytechnic Institute and State University
pp. 53-63

Analysis of a Shared Resource MIMD Computer Organization (Abstract)

R.C. Pearce , Department of Electrical Engineering, University of Waterloo
pp. 64-67

Finding the Core Point in a Fingerprint (Abstract)

C.V. Kameswara Rao , Department of Electrical Engineering, Link?ping University
pp. 77-81

An Optimal Algorithm for Computing Fourier Texture Descriptors (Abstract)

S.L. Tanimoto , Department of Computer Science, University of Washington
pp. 81-84

Optimal Sorting Algorithms for Parallel Computers (Abstract)

G. Baudet , Carnegie-Mellon University, Deparwment of Computer Science
pp. 84-87

On an Ordering of Walsh Functions (Abstract)

H. Butin , Thomson-CSF
pp. 87-90

Autotesting Speed-Independent Sequential Circuits (Abstract)

G. Cioffi , Istituto di Automatica, University of Rome
pp. 90-94

Comments on "A Measure of Computational Work" and "Logical Network Cost and Entropy" (PDF)

K. Mase , Research Division, Musashino Electrical Communication Laboratory
pp. 94-95

A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata (PDF)

null Chao-Chin Yang , Department of Information Sciences, University of Alabama in Birmingham
pp. 95-96

Call for Papers (PDF)

pp. 96
95 ms
(Ver 3.1 (10032016))