Now showing items 21-40 of 761

    • A soft touch: Compliant Tactile Sensors for Sensitive Manipulation 

      Torres-Jara, Eduardo; Vasilescu, Iuliu; Coral, Raul (2006-03-01)
      We present the design, analysis and construction of a biologicallyinspired tactile sensor. The sensor can measure normal and lateralforces, conform to the surfaces with which it comes in contact andincrease the friction ...
    • A Stream Algorithm for the SVD 

      Strumpen, Volker; Hoffmann, Henry; Agarwal, Anant (2003-10-22)
      We present a stream algorithm for the Singular-Value Decomposition (SVD) of anM X N matrix A. Our algorithm trades speed of numerical convergence for parallelism,and derives from a one-sided, cyclic-by-rows Hestenes SVD. ...
    • A Theory of Object Recognition: Computations and Circuits in the Feedforward Path of the Ventral Stream in Primate Visual Cortex 

      Serre, T.; Kouh, M.; Cadieu, C.; Knoblich, U.; Kreiman, G.; e.a. (2005-12-19)
      We describe a quantitative theory to account for the computations performed by the feedforward path of the ventral stream of visual cortex and the local circuits implementing them. We show that a model instantiating the ...
    • A Unified Information Theoretic Framework for Pair- and Group-wise Registration of Medical Images 

      Zollei, Lilla (2006-01-25)
      The field of medical image analysis has been rapidly growing for the past two decades. Besides a significant growth in computational power, scanner performance, and storage facilities, this acceleration is partially due ...
    • A Unified Statistical and Information Theoretic Framework for Multi-modal Image Registration 

      Zollei, Lilla; Fisher, John; Wells, William (2004-04-28)
      We formulate and interpret several multi-modal registration methods inthe context of a unified statistical and information theoretic framework. A unified interpretation clarifies the implicit assumptionsof each method ...
    • The Abstract MAC Layer 

      Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (2010-08-26)
      A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an abstract MAC layer. This service provides reliable local ...
    • The Abstract MAC Layer 

      Kuhn, Fabian; Newport, Calvin; Lynch, Nancy (2009-05-11)
      A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an Abstract MAC Layer. This service provides reliable local ...
    • The Abstract MAC Layer 

      Newport, Calvin; Lynch, Nancy; Kuhn, Fabian (2009-02-21)
      A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an Abstract MAC Layer. This service provides reliable local ...
    • Abstraction Layers for Scalable Microfluidic Biocomputers (Extended Version) 

      Thies, William; Urbanski, John Paul; Thorsen, Todd; Amarasinghe, Saman (2006-05-05)
      Microfluidic devices are emerging as an attractive technology for automatically orchestrating the reactions needed in a biological computer. Thousands of microfluidic primitives have already been integrated on a single ...
    • Accurate and Scalable Surface Representation and Reconstruction from Images 

      Zeng, Gang; Paris, Sylvain; Quan, Long; Sillion, Francois (2005-11-18)
      We introduce a new surface representation, the patchwork, to extend the problem of surface reconstruction from multiple images. A patchwork is the combination of several patches that are built one by one. This design ...
    • Adaptation for Regularization Operators in Learning Theory 

      Caponnetto, Andrea; Yao, Yuan (2006-09-10)
      We consider learning algorithms induced by regularization methods in the regression setting. We show that previously obtained error bounds for these algorithms using a-priori choices of the regularization parameter, can ...
    • Adaptive Envelope MDPs for Relational Equivalence-based Planning 

      Gardiol, Natalia H.; Kaelbling, Leslie Pack (2008-07-29)
      We describe a method to use structured representations of the environment’s dynamics to constrain and speed up the planning process. Given a problem domain described in a probabilistic logical description language, we ...
    • Adaptive Kernel Methods Using the Balancing Principle 

      Rosasco, Lorenzo; Pereverzyev, Sergei; De Vito, Ernesto (2008-10-16)
      The regularization parameter choice is a fundamental problem in supervised learning since the performance of most algorithms crucially depends on the choice of one or more of such parameters. In particular a main theoretical ...
    • Advancing Computational Models of Narrative 

      Richards, Whitman; Winston, Patrick Henry; Finlayson, Mark Alan (2009-12-17)
      Report of a Workshop held at the Wylie Center, Beverly, MA, Oct 8-10 2009
    • Aeolus Reference Manual 

      Liskov, Barbara (2012-09-14)
      This document describes the interface that the Aeolus information flow platform provides for users who are implementing applications using Java. The document explains how the Aeolus features are made available by means of ...
    • Agent Organization and Request Propagation in the Knowledge Plane 

      Li, Ji (2007-07-26)
      In designing and building a network like the Internet, we continue to face the problems of scale and distribution. In particular, network management has become an increasingly difficult task, and network applications often ...
    • Agent Organization in the Knowledge Plane 

      Li, Ji (2008-06-11)
      In designing and building a network like the Internet, we continue to face the problems of scale and distribution. With the dramatic expansion in scale and heterogeneity of the Internet, network management has become an ...
    • Alloy*: A Higher-Order Relational Constraint Solver 

      Milicevic, Aleksandar; Near, Joseph P.; Kang, Eunsuk; Jackson, Daniel (2014-09-02)
      The last decade has seen a dramatic growth in the use of constraint solvers as a computational mechanism, not only for analysis and synthesis of software, but also at runtime. Solvers are available for a variety of logics ...
    • Alpenhorn: Bootstrapping Secure Communication without Leaking Metadata 

      Lazar, David; Zeldovich, Nickolai (2016-10-05)
      Alpenhorn is the first system for initiating an encrypted connection between two users that provides strong privacy and forward secrecy guarantees for metadata (i.e., information about which users connected to each other) ...
    • Amorphous Computing 

      Abelson, Hal; Beal, Jacob; Sussman, Gerald Jay (2007)
      The goal of amorphous computing is to identify organizationalprinciples and create programming technologies for obtainingintentional, pre-specified behavior from the cooperation of myriadunreliable parts that are arranged ...