Now showing items 286-305 of 775

    • Flexible Execution of Plans with Choice and Uncertainty 

      Conrad, Patrick R; Williams, Brian C (2011-01-15)
      Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties, while improving robustness and reducing the need for an overly conservative plan. Executives have improved robustness by expanding ...
    • Flexible MIPS Soft Processor Architecture 

      Carli, Roberto (2008-06-16)
      The flexible MIPS soft processor architecture borrows selected technologies from high-performance computing to deliver a modular, highly customizable CPU targeted towards FPGA implementations for embedded systems; the ...
    • Flowtune: Flowlet Control for Datacenter Networks 

      Perry, Jonathan; Balakrishnan, Hari; Shah, Devavrat (2016-08-15)
      Rapid convergence to a desired allocation of network resources to endpoint traffic has been a long-standing challenge for packet-switched networks. The reason for this is that congestion control decisions are distributed ...
    • Fluorescence Assay for Polymerase Arrival Rates 

      Che, Austin (2003-08-31)
      To engineer complex synthetic biological systems will require modulardesign, assembly, and characterization strategies. The RNApolymerase arrival rate (PAR) is defined to be the rate that RNApolymerases arrive at a specified ...
    • Fragment Grammars: Exploring Computation and Reuse in Language 

      O'Donnell, Timothy J.; Tenenbaum, Joshua B.; Goodman, Noah D. (2009-03-31)
      Language relies on a division of labor between stored units and structure building operations which combine the stored units into larger structures. This division of labor leads to a tradeoff: more structure-building means ...
    • A Frequency Analysis of Monte-Carlo and other Numerical Integration Schemes 

      Durand, Frédo (2011-12-14)
      The numerical calculation of integrals is central to many computer graphics algorithms such as Monte-Carlo Ray Tracing. We show that such methods can be studied using Fourier analysis. Numerical error is shown to correspond ...
    • From Formal Methods to Executable Code 

      Musial, Peter M. (2012-08-27)
      The objective of this work is the derivation of software that is verifiably correct. Our approach is to abstract system specifications and model these in a formal framework called Timed Input/Output Automata, which provides ...
    • From primal templates to invariant recognition 

      Leibo, Joel Z; Mutch, Jim; Ullman, Shimon; Poggio, Tomaso (2010-12-04)
      We can immediately recognize novel objects seen only once before -- in different positions on the retina and at different scales (distances). Is this ability hardwired by our genes or learned during development -- and ...
    • Functional Differential Geometry 

      Sussman, Gerald Jay; Wisdom, Jack (2005-02-02)
      Differential geometry is deceptively simple. It is surprisingly easyto get the right answer with unclear and informal symbol manipulation.To address this problem we use computer programs to communicate aprecise understanding ...
    • Gasping for AIR Why we need Linked Rules and Justifications on the Semantic Web 

      Kagal, Lalana; Jacobi, Ian; Khandelwal, Ankesh (2011-04-16)
      The Semantic Web is a distributed model for publishing, utilizing and extending structured information using Web protocols. One of the main goals of this technology is to automate the retrieval and integration of data and ...
    • A Gaussian Approximation of Feature Space for Fast Image Similarity 

      Gharbi, Michael; Malisiewicz, Tomasz; Paris, Sylvain; Durand, Frédo (2012-10-01)
      We introduce a fast technique for the robust computation of image similarity. It builds on a re-interpretation of the recent exemplar-based SVM approach, where a linear SVM is trained at a query point and distance is ...
    • Gen: A General-Purpose Probabilistic Programming System with Programmable Inference 

      Cusumano-Towner, Marco F.; Saad, Feras A.; Lew, Alexander; Mansinghka, Vikash K. (2018-11-26)
      Probabilistic modeling and inference are central to many fields. A key challenge for wider adoption of probabilistic programming languages is designing systems that are both flexible and performant. This paper introduces ...
    • GenBase: A Complex Analytics Genomics Benchmark 

      Taft, Rebecca; Vartak, Manasi; Satish, Nadathur Rajagopalan; Sundaram, Narayanan; Madden, Samuel; e.a. (2013-11-19)
      This paper introduces a new benchmark, designed to test database management system (DBMS) performance on a mix of data management tasks (joins, filters, etc.) and complex analytics (regression, singular value decomposition, ...
    • Generalization and Properties of the Neural Response 

      Bouvrie, Jake; Poggio, Tomaso; Rosasco, Lorenzo; Smale, Steve; Wibisono, Andre (2010-11-19)
      Hierarchical learning algorithms have enjoyed tremendous growth in recent years, with many new algorithms being proposed and applied to a wide range of applications. However, despite the apparent success of hierarchical ...
    • Generalization in Deep Learning 

      Kawaguchi, Kenji; Kaelbling, Leslie Pack; Bengio, Yoshua (2018-05-01)
      With a direct analysis of neural networks, this paper presents a mathematically tight generalization theory to partially address an open problem regarding the generalization of deep learning. Unlike previous bound-based ...
    • Generalization of the MV Mechanism 

      Chen, Jing (2008-05-01)
      Micali and Valiant proposed a mechanism for combinatorial auctions that is dominant-strategy truthful, guarantees reasonably high revenue, and is very resilient against collusions. Their mechanism, however, uses as a ...
    • Generalized Conflict Learning For Hybrid Discrete Linear Optimization 

      Li, Hui X. (2005-05-20)
      Conflict-directed search algorithms have formed the core of practical, model-based reasoning systems for the last three decades. In many of these applications there is a series of discrete constraint optimization problems ...
    • Generating Component-based Supervised Learning Programs From Crowdsourced Examples 

      Cambronero, Jose; Rinard, Martin (2017-12-21)
      We present CrowdLearn, a new system that processes an existing corpus of crowdsourced machine learning programs to learn how to generate effective pipelines for solving supervised machine learning problems. CrowdLearn uses ...
    • Generating Trees of (Reducible) 1324-avoiding Permutations 

      Marinov, Darko; Rodoicic, Rados (2003-10-09)
      We consider permutations that avoid the pattern 1324. We give exact formulas for thenumber of reducible 1324-avoiding permutations and the number of {1324, 4132, 2413, 3241}-avoiding permutations. By studying the generating ...
    • Generative Temporal Planning with Complex Processes 

      Kennell, Jonathan (2004-05-18)
      Autonomous vehicles are increasingly being used in mission-critical applications, and robust methods are needed for controlling these inherently unreliable and complex systems. This thesis advocates the use of model-based ...