Now showing items 1069-1088 of 3804

    • Efficient Web Browsing for Mobile Clients using HTTP Compression 

      Krashinsky, Ronny (2003-01)
      Efficient web browsing on mobile computers presents a unique challenge. These machines are different from other classes of client computers since they have relatively low-bandwidth connections and they are battery-powered ...
    • Efficient, Verifiable Binary Sandboxing for a CISC Architecture 

      McCamant, Stephen; Morrisett, Greg (2005-05-02)
      Executing untrusted code while preserving security requiresenforcement of memory and control-flow safety policies:untrusted code must be prevented from modifying memory orexecuting code except as explicitly allowed. ...
    • Efficiently Solving Repeated Integer Linear Programming Problems by Learning Solutions of Similar Linear Programming Problems using Boosting Trees 

      Banerjee, Ashis Gopal; Roy, Nicholas (2015-01-21)
      It is challenging to obtain online solutions of large-scale integer linear programming (ILP) problems that occur frequently in slightly different forms during planning for autonomous systems. We refer to such ILP problems ...
    • The EIGHT Manual: A System for Geometric Modelling and Three-Dimensional Graphics on the Lisp Machine 

      Donald, Bruce R. (MIT Artificial Intelligence Laboratory, 1984-08)
      We describe a simple geometric modelling system called Eight which supports interactive creation, editing, and display of three-dimensional polyhedral solids. Perspective views of a polyhedral environment may be generated, ...
    • Elastic-Net Regularization in Learning Theory 

      De Mol, Christine; Rosasco, Lorenzo; De Vito, Ernesto (2008-07-24)
      Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie ["Regularization and variable selection via the elastic net" J. R. Stat. ...
    • Electing a Leader in a Synchronous Ring 

      Frederickson, Greg N.; Lynch, Nancy A. (1985-07)
      We consider the problem of electing a leader in a synchronous ring of n processors. We obtain both positive and negative results. One the one hand, we show that if processor ID's are chosen from some countable set, then ...
    • Electrical Design: A Problem for Artificial Intelligence Research 

      Sussman, Gerald Jay (1977-06-01)
      This report outlines the problem of intelligent failure recovery in a problem-solver for electrical design. We want our problem solver to learn as much as it can from its mistakes. Thus we cast the engineering design ...
    • Electronic Cash with Blind Deposits: How to Have No Spare Change 

      Liskov, Moses (2003-10-14)
      Electronic cash schemes in which the bank authenticates many coins at once suffer from the problem that coins that are authenticated together can be linked to one another. Unfortunately, unless a user spends coins in a ...
    • An Electronic Market-Maker 

      Chan, Nicholas Tung; Shelton, Christian (2001-04-17)
      This paper presents an adaptive learning model for market-making under the reinforcement learning framework. Reinforcement learning is a learning technique in which agents aim to maximize the long-term accumulated rewards. ...
    • 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 ...