Browsing LCS Technical Memos (1974 - 2003) by Title

Now showing items 138-157 of 492

    • Economy of Descriptions and Minimal Indices 

      Bagchi, Amitava (1972-01)

    • An Effective Representation of the Reachability Set of Persistent Petri Nets 

      Mayr, Ernst (1981-01)
      In a persistent Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which constructs a semilinear representation of the set of states reachable in an arbitrary ...

    • Effectiveness 

      Parikh, Rohit (1978-07)
      Church's thesis equates the intuitive notion "effective" with the mathematical notion "recursive." In order for this thesis to provide any information to us we have to have a clear understanding of both notions. We consider ...

    • An Efficient Algorithm for Determine the Length of the Longest Dead Path in an "LIFO" Branch-and-bound Exploration Schema 

      Pallottino, Stefano; Toffoli, Tommaso (1980-01)
      The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we ...

    • Efficient Demand-Driven Evaluation (I) 

      Pingali, Keshav; Arvind (1983-09)
      We describe a program transformation technique for programs in a general stream language L whereby a data-driven evaluation of the transformed program performs exactly the same computation as a demand-driven evaluation of ...

    • Efficient Demand-Driven Evaluation (II) 

      Pingali, Keshav; Arvind (1983-09)
      In Part I of this paper, we presented a scheme whereby a compiler could propogate demands through programs in a powerful stream language L. A data-driven evaluation of the transformed program performed exactly the same ...

    • An Efficient Implementation of A Hierarchical Weighted Fair Queue Packet Scheduler 

      Ndiaye, Oumar (1994-05)
      The technical developments in computer networks in recent years have spawned the possibility of merging different services into a single Integrated Service Packet Network (ISPN). The types of service quality required by ...

    • Efficient Multichip Partial Concentrator Switches 

      Cormen, Thomas H. (1987-02)

    • Efficient Parallel Algorithms for (_+1)-coloring and Maximal Indepdendent Set Problems 

      Goldberg, Andrew V.; Plotkin, Serge A. (1987-01)
      We describe an efficient technique for breaking symmetry in paralle. The technique works especially well on rooted trees and on graphs with a small maximum degree. In particular, we can find a maximal independent set on a ...

    • Efficient Scheduling of Tasks Without Full Use of Processor Resources 

      Jaffe, Jeffrey (1979-01)
      The nonpreemptive scheduling of a partially ordered set of tasks on a machine with m processors of different speeds is studied. Heuristics are presented which benefit from selective non-use of slow processors. The performance ...

    • Efficient View-Dependent Sampling of Visual Hulls 

      Matusik, Wojciech; Buehler, Chris; McMillan, Leonard (2002-02)
      In this paper we present an efficient algorithm for sampling visual hulls. Our algorithm computers exact points and normals on the surface of visual hull instead of a more traditional volumetric representation. The main ...

    • An Efficient Visual Hull Computation Algorithm 

      Matusik, Wojciech; Buehler, Chris; McMillan, Leonard; Gortler, Steven J. (2002-02)
      In this paper we describe an efficient algorithm for computing the visual hull of an object. This problem is equivalent to computing the intersection of generalized cones. The naïve visual hull computation algorithm requires ...

    • 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 ...

    • 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.

    • 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 ...

    • 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 ...

    • 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 ...

    • Encryption Schemes for Computer Confidentiality 

      Pless, Vera (1975-05)

    • Enhanced Certificate Revocation 

      Micali, Silvio (1996-03)
      We apply off-line/on-line signatures to provide an alternative solution to the problem of certificate revocation. The new systems dismiss with traditional CRLs (Certificate Revocation Lists) and yield public-key infrastructures ...

    • Enhanced Certificate Revocation System 

      Micali, Silvio
      We apply off-linne digital signatures to provide a novel approach to certificate revocation. Our approach dismisses with traditional CRLs and yields pubilc-key infrastructures that are several-hundred times cheaper to run ...