Now showing items 511-530 of 763

    • Parallelizing Sequential Programs With Statistical Accuracy Tests 

      Misailovic, Sasa; Kim, Deokhwan; Rinard, Martin (2010-08-05)
      We present QuickStep, a novel system for parallelizing sequential programs. QuickStep deploys a set of parallelization transformations that together induce a search space of candidate parallel programs. Given a sequential ...
    • Partial Reversal Acyclicity 

      Radeva, Tsvetomira; Lynch, Nancy (2011-04-14)
      Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving ...
    • Partitioning Strategies for Concurrent Programming 

      Devadas, Srinivas; Agarwal, Anant; Hoffmann, Henry (2009-06-16)
      This work presents four partitioning strategies, or patterns, useful for decomposing a serial application into multiple concurrently executing parts. These partitioning strategies augment the commonly used task and data ...
    • Patch complexity, finite pixel correlations and optimal denoising 

      Levin, Anat; Nadler, Boaz; Durand, Fredo; Freeman, William T. (2012-10-07)
      Image restoration tasks are ill-posed problems, typically solved withpriors. Since the optimal prior is the exact unknown density of natural images,actual priors are only approximate and typically restricted to small ...
    • Perfect and General Virtual Implementation For Perfectly Informed Players 

      Micali, Silvio; Chen, Jing (2009-12-04)
      We show that, when the players are perfectly informed about each other, essentially all social-choice functions can be rationally robustly implemented via an extensive-form public-action mechanism that (1) is perfectly ...
    • Perfect Implementation of Normal-Form Mechanisms 

      Izmalkov, Sergei; Lepinski, Matt; Micali, Silvio (2005)
      Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ...
    • Perfect Implementation of Normal-Form Mechanisms 

      Izmalkov, Sergei; Lepinski, Matt; Micali, Silvio (2007-03)
      Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ...
    • Performance and error analysis of three part of speech taggers on health texts 

      Zeng, Qing; Curtis, Dorothy (2010-02-25)
      Increasingly, natural language processing (NLP) techniques are being developed and utilized in a variety of biomedical domains. Part of speech tagging is a critical step in many NLP applications. Currently, we are developing ...
    • Permutation Tests for Classification 

      Mukherjee, Sayan; Golland, Polina; Panchenko, Dmitry (2003-08-28)
      We introduce and explore an approach to estimating statisticalsignificance of classification accuracy, which is particularly usefulin scientific applications of machine learning where highdimensionality of the data and the ...
    • PhD Thesis Proposal: Human-Machine Collaborative Optimization via Apprenticeship Scheduling 

      Gombolay, Matthew C. (2015-07-02)
      Resource optimization in health care, manufacturing, and military operations requires the careful choreography of people and equipment to effectively fulfill the responsibilities of the profession. However, resource ...
    • Phonetic Classification Using Hierarchical, Feed-forward, Spectro-temporal Patch-based Architectures 

      Rifkin, Ryan; Bouvrie, Jake; Schutte, Ken; Chikkerur, Sharat; Kouh, Minjoon; e.a. (2007-03-21)
      A preliminary set of experiments are described in which a biologically-inspired computer vision system (Serre, Wolf et al. 2005; Serre 2006; Serre, Oliva et al. 2006; Serre, Wolf et al. 2006) designed for visual object ...
    • Phonetic Classification Using Hierarchical, Feed-forward, Spectro-temporal Patch-based Architectures 

      Rifkin, Ryan; Bouvrie, Jake; Schutte, Ken; Chikkerur, Sharat; Kouh, Minjoon; e.a. (2007-02-01)
      A preliminary set of experiments are described in which a biologically-inspired computer vision system (Serre, Wolf et al. 2005; Serre 2006; Serre, Oliva et al. 2006; Serre, Wolf et al. 2006) designed for visual object ...
    • PIKA: A Network Service for Multikernel Operating Systems 

      Beckmann, Nathan Z.; Gruenwald III, Charles; Johnson, Christopher R.; Kasture, Harshad; Sironi, Filippo; e.a. (2014-01-28)
      PIKA is a network stack designed for multikernel operating systems that target potential future architectures lacking cache-coherent shared memory but supporting message passing. PIKA splits the network stack into several ...
    • A Plan for Optimizing Network-Intensive Cloud Applications 

      LaCurts, Katrina; Deng, Shuo; Balakrishnan, Hari (2013-02-12)
      A significant and growing number of applications deployed on cloud infrastructures are network-intensive. These applications are frequently bottlenecked by the speed of network connections between the machines on which ...
    • Plan-Driven Pervasive Computing 

      Look, Gary; Peters, Stephen; Shrobe, Howard (2006-03-01)
      The goal of human-centered, pervasive computing should be to hide the details of the computing environment, allowing users to concentrate on their goals, rather than on the direct management of devices. This paper describes ...
    • Planning Robust Strategies for Constructing Multi-object Arrangements 

      Anders, Ariel; Kaelbling, Leslie; Lozano-Perez, Tomas (2017-01-30)
      A crucial challenge in robotics is achieving reliable results in spite of sensing and control uncertainty. A prominent strategy for dealing with uncertainty is to construct a feedback policy, where actions are chosen as a ...
    • Pluggable type-checking for custom type qualifiers in Java 

      Papi, Matthew M.; Ali, Mahmood; Correa Jr., Telmo Luis; Perkins, Jeff H.; Ernst, Michael D. (2007-09-17)
      We have created a framework for adding custom type qualifiers to the Javalanguage in a backward-compatible way. The type system designer definesthe qualifiers and creates a compiler plug-in that enforces theirsemantics. ...
    • Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk 

      Hajiaghayi, MohammadTaghi; Kortsarz, Guy; Salavatipour, Mohammad R. (2005-11-26)
      We consider the non-uniform multicommodity buy-at-bulknetworkdesign problem. In this problem we are given a graph $G(V,E)$withtwo cost functions on the edges, a buy cost $b:E\longrightarrow \RR^+$and a rent cost$r:E\long ...
    • Possibilistic Beliefs and Higher-Level Rationality 

      Chen, Jing; Micali, Silvio; Pass, Rafael (2014-06-09)
      We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible ...
    • Possibilistic Beliefs and Higher-Level Rationality 

      Chen, Jing; Micali, Silvio; Pass, Rafael (2014-06-09)
      We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible ...