Now showing items 3747-3766 of 3804

    • Wafer-scale Integration of Systolic Arrays 

      Leighton, Frank Thomson; Leiserson, Charles E. (1983-02)
      VLSI technologists are fast developing wafer-scale integration. Rather than partitioning a silicon wafer into chips as is usually done, the idea behind wafer-scale integration is to assemble an entire system (or network ...
    • Wait-and-See Strategies for Parsing Natural Language 

      Marcus, Mitchell P. (MIT Artificial Intelligence Laboratory, 1974-08)
      The intent of this paper is to convey one idea central to the structure of a natural language parser currently under development, the notion of wait-and-see strategies. This notion will hopefully allow the recognition of ...
    • Wait-free Regular Storage from Byzantine Components 

      Abraham, Ittai; Chockler, Gregory; Keidar, Idit; Malkhi, Dahlia (2005-04-05)
      We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block, called 1-regular register, which can be ...
    • Waiting Algorithms for Synchornization in Large-scale Multiprocessors 

      Lim, Beng-Hong; Agarwal, Anant (1991-02)
      Through analysis and experiments, this paper investigates two-phase waiting algorithms to minimize the cost of waiting for synchronization in large-scale multiprocessors. In a two-phase algorithm, a thread first waits by ...
    • Walter User's Manual (Version 1.0) 

      Gifford, David K.; Cote, Robert G.; Segal, David A. (1987-09)
      Walter is a UNIX program that provides access to databases located at MIT via the DARPA Internet. The databases provided by Walter include the full-text of the New York Times for the past 90 days. A sophisticated full-text ...
    • Wandering About the Top of the Robot 

      Winston, Patrick H. (MIT Artificial Intelligence Laboratory, 1971-07)
      Part I of this paper describes some of the new functions in the system. The discussion is seasoned here and there with parenthetical code fragments that may be ignored by readers unfamiliar with PLANNER. Part II discussed ...
    • Was the Patient Cured? Understanding Semantic Categories and Their Relationships in Patient Records 

      Sibanda, Tawanda Carleton (2006-06-28)
      In this thesis, we detail an approach to extracting key information in medical discharge summaries. Starting with a narrative patient report, we first identify and remove information that compromises privacy (de-identifi ...
    • WaveScript: A Case-Study in Applying a Distributed Stream-Processing Language 

      Newton, Ryan; Girod, Lewis; Craig, Michael; Madden, Sam; Morrisett, Greg (2008-01-31)
      Applications that combine live data streams with embedded, parallel,and distributed processing are becoming more commonplace. WaveScriptis a domain-specific language that brings high-level, type-safe,garbage-collected ...
    • Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions 

      Adya, Atul (1999-03)
      Current commercial databases allow application programmers to trade off consistency for performance. However, existing definitions of weak consistency levels are either imprecise or they disallow efficient implementation ...
    • Weak Monadic Second Order Theory of Successor is not Element-recurive 

      Meyer, Albert R. (1973-12)
      Let L SIS be the set of formulas expressible in a week monadic second order logic using only the predicates [x =y+1] and [x E z]. Bucci and Elgot [3,4] have shown that the truth of sentences in L SIS (under the standard ...
    • Werner Reichardt: the man and his scientific legacy 

      Poggio, Tomaso (2011-03-04)
      Excerpts from a talk given by Tomaso Poggio in Tübingen on the opening ofthe Werner Reichardt Centrun für Integrative Neurowissenschaften, December 8, 2008.
    • Whanaungatanga: Sybil-proof routing with social networks 

      Lesniewski-Laas, Chris; Kaashoek, M. Frans (2009-09-24)
      Decentralized systems, such as distributed hash tables, are subject to the Sybil attack, in which an adversary creates many false identities to increase its influence. This paper proposes a routing protocol for a distributed ...
    • What a Parallel Programming Language Has to Let You Say 

      Bawden, Alan; Agre, Philip E. (1984-09-01)
      We have implemented in simulation a prototype language for the Connection Machine called CL1. CL1 is an extrapolation of serial machine programming language technology: in CL1 one programs the individual processors ...
    • What Are Plans For? 

      Agre, Philip E.; Chapman, David (1989-10-01)
      What plans are like depends on how they're used. We contrast two views of plan use. On the plan-as-program-view, plan use is the execution of an effective procedure. On the plan-as-communication view, plan use is like ...
    • What are principal typings and what are they good for? 

      Jim, Trevor (1995-11)
      We demonstrate the pragmatic value of the principal typing property, a property more general than ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection ...
    • What are principal typings and what are they good for? 

      Jim, Trevor (1995-08)
      We demonstrate the pragmatic value of the principal typing property, a property more general than ML's principal type property, by studying a type system with principal typings. The type system is based on rank 2 intersection ...
    • What Corners Look Like 

      Dowson, Mark; Waltz, David (MIT Artificial Intelligence Laboratory, 1971-06)
      An algorithm is presented which provides a way of telling what a given trihedral corner will look like if viewed from a particular angle. The resulting picture is a junction of two or more lines each labelled according to ...
    • What is a Model of the Lamda Calculus? Expanded Version 

      Meyer, Albert R. (1981-07)
      An elementary, purely algebraic definition of model for the untypes lambda calculus is given. This definition is shown to be equivalent to the natural semantic definition based on environments. These definitions of model ...
    • What is Decidable about Strings? 

      Ganesh, Vijay; Minnes, Mia; Solar-Lezama, Armando; Rinard, Martin (2011-02-01)
      We prove several decidability and undecidability results for the satisfiability/validity problem of formulas over a language of finite-length strings and integers (interpreted as lengths of strings). The atomic formulas ...
    • What is Delaying the Manipulator Revolution? 

      Horn, Berthold K.P. (MIT Artificial Intelligence Laboratory, 1978-02)
      Despite two decades of work on mechanical manipulators and their associated controls, we do not see wide-spread application of these devices to many of the tasks to which they seem so obviously suited. Somehow, a variety ...