19,967 research outputs found
Oral history interview with Stephen Cook
No full textTranscript, 30 pp.Cook recounts his early interest in electronics and association with electronic cardiac pacemaker inventor Wilson Greatbatch, and his education at the University of Michigan and Harvard University. He describes his first position as an assistant professor of mathematics at the University of California, Berkeley, and his growing interest in problems of computational complexity preceding an influential 1971 presentation on “The Complexity of Theorem Proving Procedures” at the ACM SIGACT Symposium on the Theory of Computing. Cook discusses his move to the University of Toronto in 1970 and the reception of his work on NP-completeness, leading up to his A.M. Turing Award for “contributions to the theory of computational complexity, including the concept of nondeterministic, polynomial-time completeness.” He also discusses the feasibility of solving the P versus NP Problem.Cook, Stephen Arthur.. (2002). Oral history interview with Stephen Cook. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/107226
[Letter from Fred Cook to Stephen Salant]
No full text1 p.Personal correspondence between Fred Cook and Stephen Salan
Service-oriented models for audiovisual content storage
No full textWhat are the important topics to understand if involved with storage services to hold digital audiovisual content? This report takes a look at how content is created and moves into and out of storage; the storage service value networks and architectures found now and expected in the future; what sort of data transfer is expected to and from an audiovisual archive; what transfer protocols to use; and a summary of security and interface issues
Cook, S S (Sydney Stephen), VX65365
No full textThis record was harvested from a previous catalogue system and will be withdrawn in 2025. Information in this record may be superseded or incomplete. Visit this record in UMA's new catalogue at: https://archives.library.unimelb.edu.au/nodes/view/378554Surname: COOK
Given Name(s) or Initials: S S (SYDNEY STEPHEN)
Military Service Number or Last Known Location: VX65365
Missing, Wounded and Prisoner of War Enquiry Card Index Number: 38796192367
Item: [2016.0049.10848] "Cook, S S (Sydney Stephen), VX65365
An Interview with Stephen A. Cook
No full textStephen A. Cook, winner of the 1982 AM Turing Award, reflects on his career. nature of nP-complete class of problems has been one of the most active and important research activities in computer science.” Cook further discusses the feasibility of solving the P versus nP problem, which has recently received renewed attention given increasingly powerful computational capabilities and the decreasing cost of computing. In a September 2009 Communications article, Lance Fortnow wrote that Cook\u27s work on computational ..
I wish I could welcome the spring bonnie bird, with a carol as joyous as thine [first line]
No full textstrophic with choruspiano and voiceJohns Hopkins University, Levy Sheet Music Collection, Box
120, Item 090By Eliza Cook and Stephen Glover.J. Sinclair's lith. 107 Chesnut St. Phila
I wish I could welcome the spring bonnie bird, with a carol as joyous as thine [first line]
No full textstrophic with choruspiano and voiceJohns Hopkins University, Levy Sheet Music Collection, Box
120, Item 090By Eliza Cook and Stephen Glover.J. Sinclair's lith. 107 Chesnut St. Phila
- …
