Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Now showing items 744-763 of 775

    • Using Program Synthesis for Social Recommendations 

      Cheung, Alvin; Solar-Lezama, Armando; Madden, Samuel (2012-08-13)
      This paper presents a new approach to select events of interest to a user in a social media setting where events are generated by the activities of the user's friends through their mobile devices. We argue that given the ...

    • Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2007-02-16)
      The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on implementation ...

    • Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-06-20)
      The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about theircorrectness using multiple levels of abstraction, based on implementation ...

    • Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-03-08)
      AbstractThe Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on ...

    • Using The Barton Libraries Dataset As An RDF benchmark 

      Abadi, Daniel J.; Marcus, Adam; Madden, Samuel R.; Hollenbach, Kate (2007-07-06)
      This report describes the Barton Libraries RDF dataset and Longwell querybenchmark that we use for our recent VLDB paper on Scalable Semantic WebData Management Using Vertical Partitioning.

    • Value-Deviation-Bounded Serial Data Encoding for Energy-Efficient Approximate Communication 

      Stanley-Marbell, Phillip; Rinard, Martin (2015-06-04)
      Transferring data between ICs accounts for a growing proportion of system power in wearable and mobile systems. Reducing signal transitions reduces the dynamic power dissipated in this data transfer, but traditional ...

    • Verifiably Secure Devices 

      Lepinski, Matt; Micali, Silvio; Izmalkov, Sergei (2007-12-05)
      We put forward the notion of a verifiably secure device, in essence a stronger notion of secure computation, and achieve it in the ballot-box model. Verifiably secure devices1. Provide a perfect solution to the problem of ...

    • Verification of Semantic Commutativity Conditions and Inverse Operations on Linked Data Structures 

      Kim, Deokhwan; Rinard, Martin C. (2010-12-03)
      Commuting operations play a critical role in many parallel computing systems. We present a new technique for verifying commutativity conditions, which are logical formulas that characterize when operations commute. Because ...

    • Verifying Quantitative Reliability of Programs That Execute on Unreliable Hardware 

      Carbin, Michael; Misailovic, Sasa; Rinard, Martin (2013-06-19)
      Emerging high-performance architectures are anticipated to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and recovery from soft errors is ...

    • Verifying the Correctness of Wide-Area Internet Routing 

      Feamster, Nick; Balakrishnan, Hari (2004-05-17)
      Several studies have shown that wide-area Internet routing is fragile, with failures occurring for a variety of reasons. Routing fragility is largely due to the flexible and powerful ways in which BGP can be configured to ...

    • Versatility and VersaBench: A New Metric and a Benchmark Suite for Flexible Architectures 

      Rabbah, Rodric M.; Bratt, Ian; Asanovic, Krste; Agarwal, Anant (2004-06-14)
      For the last several decades, computer architecture research has largely benefited from, and continues to be driven by ad-hoc benchmarking. Often the benchmarks are selected to represent workloads that architects believe ...

    • Victim Migration: Dynamically Adapting Between Private and Shared CMP Caches 

      Zhang, MIchael; Asanovic, Krste (2005-10-10)
      Future CMPs will have more cores and greater onchip cache capacity. The on-chip cache can either be divided into separate private L2 caches for each core, or treated as a large shared L2 cache. Private caches provide low ...

    • Video Matching 

      Sand, Peter; Teller, Seth (2004-05-11)
      This paper describes a method for bringing two videos (recorded at different times) into spatiotemporal alignment, then comparing and combining corresponding pixels for applications such as background subtraction, compositing, ...

    • The Video Mesh: A Data Structure for Image-based Video Editing 

      Durand, Fredo; Cohen, Michael; Chen, Jiawen; Paris, Sylvain; Wang, Jue; e.a. (2009-12-16)
      This paper introduces the video mesh, a data structure for representing video as 2.5D "paper cutouts." The video mesh allows interactive editing of moving objects and modeling of depth, which enables 3D effects and ...

    • Viewstamped Replication Revisited 

      Liskov, Barbara; Cowling, James (2012-07-23)
      This paper presents an updated version of Viewstamped Replication, a replication technique that handles failures in which nodes crash. It describes how client requests are handled, how the group reorganizes when a replica ...

    • Virtual Mobile Nodes for Mobile Ad Hoc Networks 

      Dolev, Shlomi; Gilbert, Seth; Lynch, Nancy A.; Schiller, Elad; Shvarstman, Alex A.; e.a. (2004-02-26)
      One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of mobile nodes. If, instead, the mobile nodes could be programmed totravel through the world ...

    • Virtual Monotonic Counters and Count-Limited Objects using a TPM without a Trusted OS (Extended Version) 

      Sarmenta, Luis F. G.; van Dijk, Marten; O'Donnell, Charles W.; Rhodes, Jonathan; Devadas, Srinivas (2006-09-11)
      A trusted monotonic counter is a valuable primitive thatenables a wide variety of highly scalable offlineand decentralized applications that would otherwise be prone to replay attacks, including offline payment, e-wallets, ...

    • Virtual Stationary Automata for Mobile Networks 

      Dolev, Shlomi; Gilbert, Seth; Lahiani, Limor; Lynch, Nancy; Nolte, Tina (2005-01-21)
      We define a programming abstraction formobile networks called the Virtual Stationary Automataprogramming layer, consisting of real mobile clients, virtualtimed I/O automata called virtual stationary automata(VSAs), and a ...

    • Virtual Visual Hulls: Example-Based 3D Shape Estimation from a Single Silhouette 

      Grauman, Kristen; Shakhnarovich, Gregory; Darrell, Trevor (2004-01-28)
      Recovering a volumetric model of a person, car, or other objectof interest from a single snapshot would be useful for many computergraphics applications. 3D model estimation in general is hard, andcurrently requires active ...

    • Vote the OS off your Core 

      Belay, Adam; Wentzlaff, David; Agarwal, Anant (2011-07-27)
      Recent trends in OS research have shown evidence that there are performance benefits to running OS services on different cores than the user applications that rely on them. We quantitatively evaluate this claim in terms ...