Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Now showing items 1078-1097 of 3804

    • Elementary Geometry Theorem Proving 

      Goldstein, Ira (1973-04-01)
      An elementary theorem prover for a small part of plane Euclidean geometry is presented. The purpose is to illustrate important problem solving concepts that naturally arise in building procedural models for mathematics.

    • EM2: A Scalable Shared-Memory Multicore Architecture 

      Khan, Omer; Lis, Mieszko; Devadas, Srini (2010-06-12)
      We introduce the Execution Migration Machine (EM2), a novel, scalable shared-memory architecture for large-scale multicores constrained by off-chip memory bandwidth. EM2 reduces cache miss rates, and consequently off-chip ...

    • Emacs Lisp in Edwin SScheme 

      Birkholz, Matthew (1993-09-01)
      The MIT-Scheme program development environment includes a general-purpose text editor, Edwin, that has an extension language, Edwin Scheme. Edwin is very similar to another general-purpose text editor, GNU Emacs, which ...

    • EMACS Manual for ITS Users 

      Stallman, Richard M. (1981-10-01)
      A reference manual for the extensible, customizable, self-documenting real-time display editor. This manual corresponds to EMACS version 162.

    • EMACS Manual for TWENEX Users 

      Stallman, Richard M. (1983-03-01)
      A reference manual for the extensible, customizable, self-documenting real-time display editor. This manual corresponds to EMACS version 162.

    • EMACS: The Extensible, Customizable, Self-Documenting Display Editor 

      Stallman, Richard M. (1981-03-01)
      EMACS is a display editor which is implemented in an interpreted high level language. This allows users to extend the editor by replacing parts of it, to experiment with alternative command languages, and to share ...

    • Embedding Cryptographic Trapdoors in Arbirtrary Knapsack Systems 

      Shamir, Adi (1982-09)
      In this paper we show that after sufficiently many modular multiplications, any knapsack system becomes a trapdoor system that can be used in pubic-key cryptography.

    • Embodiment and Manipulation Learning Process for a Humanoid Hand 

      Matsuoka, Yoky (1995-05-01)
      Babies are born with simple manipulation capabilities such as reflexes to perceived stimuli. Initial discoveries by babies are accidental until they become coordinated and curious enough to actively investigate their ...

    • Embracing Wireless Interference: Analog Network Coding 

      Katti, Sachin; Gollakota, Shyamnath; Katabi, Dina (2007-02-23)
      Traditionally, interference is considered harmful.Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages ...

    • Empirical Analysis of a Token Ring Network 

      Feldmeier, David C. (1984-01)
      The MIT Laboratory for Computer Science 10 Megabit token ring local area network was monitored. Over a one-week period 7 million packets and 1.3 billion bytes passes by the monitor. This thesis compares the MIT ring traffic ...

    • An Empirical Comparison of SNoW and SVMs for Face Detection 

      Alvira, Mariano; Rifkin, Ryan (2001-01-01)
      Impressive claims have been made for the performance of the SNoW algorithm on face detection tasks by Yang et. al. [7]. In particular, by looking at both their results and those of Heisele et. al. [3], one could infer that ...

    • Empirical Effective Dimension and Optimal Rates for Regularized Least Squares Algorithm 

      Caponnetto, Andrea; Rosasco, Lorenzo; Vito, Ernesto De; Verri, Alessandro (2005-05-27)
      This paper presents an approach to model selection for regularized least-squares on reproducing kernel Hilbert spaces in the semi-supervised setting. The role of effective dimension was recently shown to be crucial in the ...

    • An Empirical Study of Program Modification Histories 

      Zelinka, Linda M. (MIT Artificial Intelligence Laboratory, 1983-03)
      Large programs undergo many changes before they run in a satisfactory manner. For many large programs, modification histories are kept which record every change that is made to the program. By studying these records, ...

    • The Emptiness and Complementation Problems for Automata on Infinite Trees 

      Rackoff, Charles Weill (1973-01)
      In [6] Rabin defines Automata on Infinite Trees, and the body of that paper is concerned with proving two theorems about these automata. The result we consider in the first chapter says that there exists an effective ...

    • The Emptiness Problem for Automata on Infinite Trees 

      Hossley, Robert; Rackoff, Charles (1972-06)
      The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin [4]. The proof reduces the emptiness problem for automata on infinite trees to ...

    • Encapsulated Key Escrow 

      Bellare, Mihir; Goldwasser, Shafi (1996-04)

    • An Enciphering Module for Multics 

      Benedict, G. Gordon (1974-07)
      Recently IBM Corporation has declassified an algorithm for encryption usable for computer-to-computer or computer-to-terminal communications. Their algorithm was implemented in a hardware device called Lucifer. A software ...

    • Encrypted Keyword Search in a Distributed Storage System 

      Artzi, Shay; Kiezun, Adam; Newport, Calvin; Schultz, David (2006-02-23)
      Encrypted keyword search allows a server to perform a search over a set of encrypted documents on behalf of a client without learning the contents of the documents or the words being searched for. Designing a practical ...

    • Encryption Schemes for Computer Confidentiality 

      Pless, Vera (1975-05)

    • Encryption-based Protection Protocols for Interactive User-computer Communication 

      Kent, Stephen T. (1976-06)
      This thesis develops a complete set of protocols, which utilize a block cipher, e.g., the NBS data encryption standard, for protection interactive user-computer communication over physically unsecured channels. The use ...