Now showing items 690-709 of 806

    • Structuring Unreliable Radio Networks 

      Censor-Hillel, Keren; Gilbert, Seth; Kuhn, Fabian; Lynch, Nancy; Newport, Calvin (2011-12-22)
      In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model. This model includes two types of links: reliable links, which always deliver ...
    • Style Translation for Human Motion 

      Hsu, Eugene; Pulli, Kari; Popovic, Jovan (2005-08-01)
      Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
    • Style Translation for Human Motion (Supplemental Material) 

      Hsu, Eugene; Pulli, Kari; Popovic, Jovan (2005-08-01)
      Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
    • Subcontracted Rational SFE 

      Lepinski, Matthew; Micali, Silvio (2005-11-02)
      In their paper, "Rational Secure Computation and Ideal Mechanism Design," Izmalkov, Lepinski and Micali show that any one-shot mediated game can be simulated by the players themselves, without the help of a trusted mediator, ...
    • Submodular Secretary Problem and Extensions 

      Zadimoghaddam, Morteza; Hajiaghayi, MohammadTaghi; Bateni, MohammadHossein (2010-02-01)
      Online auction is an essence of many modern markets, particularly networked markets, in which information about goods, agents, and outcomes is revealed over a period of time, and the agents must make irrevocable decisions ...
    • Sufficient Conditions for Uniform Stability of Regularization Algorithms 

      Poggio, Tomaso; Rosasco, Lorenzo; Wibisono, Andre (2009-12-01)
      In this paper, we study the stability and generalization properties of penalized empirical-risk minimization algorithms. We propose a set of properties of the penalty term that is sufficient to ensure uniform ?-stability: ...
    • A Suite of Techniques for Describing Activity in Terms of Events 

      Borchardt, Gary C. (2015-03-30)
      This report presents a set of software techniques that support the tasks of event recognition, summarization of event sequences, explanation of recognized events, explanation of non-recognized events, prediction of event ...
    • Supplement to "Distributed Quota Enforcement for Spam Control" 

      Walfish, Michael; Zamfirescu, J.D.; Balakrishnan, Hari; Karger, David; Shenker, Scott (2006-04-29)
      This report is a supplement to our paper "Distributed Quota Enforcement forSpam Control" (NSDI 2006). We assume here that the reader has readthe main paper. In this report, we first analyze the enforcer nodes'key-value ...
    • Supplementary Materials for "A Survey of Corpora in Computational and Cognitive Narrative Science" 

      Finlayson, Mark Alan (2014-12-30)
      This archive contains supplementary materials for the article titled "A Survey of Corpora in Computational and Cognitive Narrative Science" by Mark A. Finlayson, published in the journal *Sprache und Datenverarbeitung*. ...
    • Supplementary materials for "ProppLearner: Deeply Annotating a Corpus of Russian Folktales to Enable the Machine Learning of a Russian Formalist Theory" 

      Finlayson, Mark Alan (2015-12-02)
      This archive contains the supplementary material for the journal article "ProppLearner: Deeply Annotating a Corpus of Russian Folktales to Enable the Machine Learning of a Russian Formalist Theory", published in the Journal ...
    • SWIFT: A Narrowband-Friendly Cognitive Wideband Network 

      Sodini, Charles; Edalat, Farinaz; Katabi, Dina; Kushman, Nate; Rahul, Hariharan (2008-08-17)
      Wideband technologies in the unlicensed spectrum can satisfy the ever-increasing demands for wireless bandwidth created by emerging rich media applications. The key challenge for such systems, however, is to allow narrowband ...
    • Symbolic Execution for (Almost) Free: Hijacking an Existing Implementation to Perform Symbolic Execution 

      Near, Joseph P.; Jackson, Daniel (2014-04-22)
      Symbolic execution of a language is traditionally achieved by replacing the language s interpreter with an entirely new interpreter. This may be an unnecessary burden, and it is tempting instead to try to use as much of ...
    • Synthesis of Randomized Accuracy-Aware Map-Fold Programs 

      Misailovic, Sasa; Rinard, Martin (2013-12-29)
      We present Syndy, a technique for automatically synthesizing randomized map/fold computations that trade accuracy for performance. Given a specification of a fully accurate computation, Syndy automatically synthesizes ...
    • Systematic Conformational Search with Constraint Satisfaction 

      Tucker-Kellogg, Lisa (2004-10-01)
      Throughout biological, chemical, and pharmaceutical research,conformational searches are used to explore the possiblethree-dimensional configurations of molecules. This thesis describesa new systematic method for ...
    • Systematic Removal of Nondeterminism for Code Generation in I/O Automata 

      Vaziri, Mandana; Tauber, Joshua A.; Tsai, Michael J.; Lynch, Nancy (2004-07-19)
      The Input/Output (I/O) automaton model developed by Lynch and Tuttle models components in asynchronous concurrentsystems as labeled transition systems. IOA is a precise language for describing I/O automata and for stating ...
    • Table 1 (Supplemental): Summary of expression programs discovered by GeneProgram from Novartis Tissue Atlas v2 data 

      Gerber, Georg K.; Dowell, Robin D.; Jaakkola, Tommi S.; Gifford, David K. (2007-06-25)
      Table 1 (Supplemental): Summary of recurrent expression programs (EPs) discovered by GeneProgram. The columns are: (1) the EP identifier (an arbitrarily assigned number), (2) the number of genes in the EP, (3) the number ...
    • Table 2 (Supplemental): Complete data for all 100 expression programs discovered by GeneProgram from the Novartis Gene Atlas v2 

      Gerber, Georg K.; Dowell, Robin D.; Jaakkola, Tommi S.; Gifford, David K. (2007-06-25)
      Table 2 (Supplemental): Complete data for all 100 recurrent expression programs (EPs) discovered by GeneProgram. Each EP has two identifying rows, a list of meta-genes, and a list of significantly enriched GO categories. ...
    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2009.)
      Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims about probabilities of ...
    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-03-31)
      In the Probabilistic I/O Automata (PIOA) framework, nondeterministicchoices are resolved using perfect-information schedulers,which are similar to history-dependent policies for Markov decision processes(MDPs). These ...
    • Task-Structured Probabilistic I/O Automata 

      Canetti,, Ran; Cheung,, Ling; Kaynar,, Dilsun; Liskov,, Moses; Lynch,, Nancy; e.a. (2006-09-05)
      Modeling frameworks such as Probabilistic I/O Automata (PIOA) andMarkov Decision Processes permit both probabilistic andnondeterministic choices. In order to use such frameworks to express claims about probabilities of ...