Filters








46,349 Hits in 2.8 sec

Distributed data base management

C. Mohan
1980 Proceedings of the ACM 1980 annual conference on - ACM 80  
Mohan, C. [1978b] An Overview of Recent Data Base Research, ACM SIGBDP's Data Base I0, 2, Fall (Also Tech. Rep. SDBEG-5, Univ. of Texas at Austin, April 1978). 34.  ...  ACM-SIGMOD Menasce, D., Muntz, R. [1978b] Locking and Deadlock Detection in Distributed Databases, Proc. III Berkeley Workshop on Distributed Data Management and Computer Networks, August.  ... 
doi:10.1145/800176.809995 dblp:conf/acm/Mohan80 fatcat:lad6potsxrhndgdzvzivn4lwlu

Computer generated animation of faces

Frederick I. Parke
1972 Proceedings of the ACM annual conference on - ACM'72  
doi:10.1145/569951.569955 fatcat:qj7fhrsntbgptkxyyy4c6wes6q

Computer generated animation of faces

Frederick I. Parke
1972 Proceedings of the ACM annual conference on - ACM'72  
doi:10.1145/800193.569955 fatcat:vhnx7bs3pneczbpd5sxht5t35y

A case against the GOTO

William A. Wulf
1972 Proceedings of the ACM annual conference on - ACM '72  
Dijkstra in a letter to the editor of the Communications of the ACM in 1968 (I).  ... 
doi:10.1145/800194.805861 fatcat:bcogguln6zdzvcxjjpbi24kffy

A system for computer generated movies

Edwin Catmull
1972 Proceedings of the ACM annual conference on - ACM'72  
doi:10.1145/800193.569952 fatcat:osbtoyxzkfau3ayn2hltgu46ai

Recent improvements in Braille transcription

Jonathan Allen, W. Terry Borroz
1972 Proceedings of the ACM annual conference on - ACM'72  
Standard Grade II Braille uses 189 contractions to decrease the bulk of Braille text, and increase the speed of reading. The rules for the use of these contractions, however, are ambiguous and difficult to apply. A method is presented for detecting letter-string units which are functioning as linguistic units (morphs or clusters) in words. These units may then be contracted by either the Grade II system, or a more efficient procedure based on the frequency of occurrence of these units. Thus
more » ... lle can be encoded algorithmically by computer, and many of the "sequence" errors associated with other schemes are avoided.
doi:10.1145/569921.569922 fatcat:johyrrcdszffzonebs65r5bs64

Recent improvements in Braille transcription

Jonathan Allen, W. Terry Borroz
1972 Proceedings of the ACM annual conference on - ACM'72  
Standard Grade II Braille uses 189 contractions to decrease the bulk of Braille text, and increase the speed of reading. The rules for the use of these contractions, however, are ambiguous and difficult to apply. A method is presented for detecting letter-string units which are functioning as linguistic units (morphs or clusters) in words. These units may then be contracted by either the Grade II system, or a more efficient procedure based on the frequency of occurrence of these units. Thus
more » ... lle can be encoded algorithmically by computer, and many of the "sequence" errors associated with other schemes are avoided.
doi:10.1145/800193.569922 fatcat:ufvol76jvbehla4z6vmjqrl4ya

Computer data communication

Simon S. Lam
1973 Proceedings of the annual conference on - ACM'73  
ACM 13, 2 (April 1966), 205-210. 2N. E. Gibbs, A cycle generation algorithm for finite undirected linear graphs. J. ACM i_~6, 4 (Oct. 1969), 564-568. I. S~ntactic Picture Recognition.  ... 
doi:10.1145/800192.805758 dblp:conf/acm/Lam73 fatcat:ftzwul4tunabjhbi7ot2qdju4u

Definitional interpreters for higher-order programming languages

John C. Reynolds
1972 Proceedings of the ACM annual conference on - ACM '72  
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy's definition of LISP, Landin's SECD machine, the Vienna definition of PL/I, Reynolds' definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be
more » ... ied according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call by value versus call by name) in the defined language depends upon the order of application in the defining language. As an example, we consider the definition of a simple applicative programming language by means of an interpreter written in a similar language. Definitions in each of the above classifications are derived from one another by informal but constructive methods. The treatment of imperative features such as jumps and assignment is also discussed.
doi:10.1145/800194.805852 fatcat:fiakjk5eojbjte5xwx3v56kzbq

Abstracto 84

Lambert Meertens
1979 Proceedings of the 1979 annual conference on - ACM 79  
To copy otherwise, or to republish, requires a fee and/or specific permission. ©1979 ACM 0-89791-008-7/79/1000/0033 $00.75 language is to write a program.  ...  to write an algorithm in a programming Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM  ... 
doi:10.1145/800177.810022 dblp:conf/acm/Meertens79 fatcat:kk4ujvh5e5ezpprt57rxwu7yjm

Interactive task behavior in a time-sharing environment

Murty Parupudi, Joseph Winograd
1972 Proceedings of the ACM annual conference on - ACM '72  
., "Interarrival Statistics for Time Sharing Systems," Communications ACM, Vol. 9, No.7, pp. 500-503, July 1966. 23 EDP conversion consideration by WILLIAM E. HANNA, JR.  ...  National Computer Conference, 1973 21. Yourdon, E., "An Approach to Measuring a Time Sharing System," Datamation, Vol. 15, No.4, pp. 124-126, April 1969. 22 . Coffman, E. G., Jr., Wood, R.  ... 
doi:10.1145/800194.805847 fatcat:gwyff5n4rzfchhauogu7t3n6sm

Social implications of artificial intelligence

Ira Pohl
1984 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge - ACM 84  
Most of the claims made in this book are strongly founded on those made in peer-reviewed conferences and journals.  ...  This was particularly noticeable at interdisciplinary conférences, where I would often be seen more as an apologist for AI than I had been previously.  ... 
doi:10.1145/800171.809654 dblp:conf/acm/Pohl84 fatcat:4fpfmt5lizaijc4wcwe3iz7qny

Conditions On Acquisitional Models

Brian MacWhinney
1978 Proceedings of the 1978 annual conference on - ACM 78  
G 1978 ACM 0-89791-000-I/78/0012/0~I /$00.75 fact that acquisitional models are subject to a wide array of fairly stringent ~ priori conditions.  ...  reason for this state of affairs is the Permission to copy without tee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM  ... 
doi:10.1145/800127.804141 dblp:conf/acm/MacWhinney78 fatcat:wxtj27anvrbzvho4dtcj6biahm

A solution to the hidden surface problem

M. E. Newell, R. G. Newell, T. L. Sancha
1972 Proceedings of the ACM annual conference on - ACM'72  
doi:10.1145/800193.569954 fatcat:ljbxoilbmzc3jjdr6qlwgfr4q4

A solution to the hidden surface problem

M. E. Newell, R. G. Newell, T. L. Sancha
1972 Proceedings of the ACM annual conference on - ACM'72  
doi:10.1145/569951.569954 fatcat:xspkww7n2rc5hn4cc6mthz26gm
« Previous Showing results 1 — 15 out of 46,349 results