Now showing items 260-279 of 765

    • Face processing in humans is compatible with a simple shape-based model of vision 

      Riesenhuber; Jarudi; Gilad; Sinha (2004-03-05)
      Understanding how the human visual system recognizes objects is one of the key challenges in neuroscience. Inspired by a large body of physiological evidence (Felleman and Van Essen, 1991; Hubel and Wiesel, 1962; Livingstone ...
    • Faces as a "Model Category" for Visual Object Recognition 

      Tan, Cheston; Poggio, Tomaso (2013-03-18)
      Visual recognition is an important ability that is central to many everyday tasks such as reading, navigation and social interaction, and is therefore actively studied in neuroscience, cognitive psychology and artificial ...
    • Factors Affecting the Adoption of Faculty-Developed Academic Software: A Study of Five iCampus Projects 

      Ehrmann, Stephen C.; Gilbert, Steven W.; McMartin, Flora; Abelson, Harold; Long, Philip D. (2007-10-20)
      Instruction in higher education must adapt more rapidly to: changes in workforce needs, global issues, advances in disciplines, and resource constraints. The pace of such improvement depends on the speed with which new ...
    • Fast and Robust Pyramid-based Image Processing 

      Aubry, Mathieu; Paris, Sylvain; Hasinoff, Samuel W.; Kautz, Jan; Durand, Frédo (2011-11-15)
      Multi-scale manipulations are central to image editing but they are also prone to halos. Achieving artifact-free results requires sophisticated edgeaware techniques and careful parameter tuning. These shortcomings were ...
    • Fast concurrent object classification and localization 

      Yeh, Tom; Lee, John J.; Darrell, Trevor (2008-06-10)
      Object localization and classification are important problems incomputer vision. However, in many applications, exhaustive searchover all class labels and image locations is computationallyprohibitive. While several methods ...
    • Fast Contour Matching Using Approximate Earth Mover's Distance 

      Grauman, Kristen; Darrell, Trevor (2003-12-05)
      Weighted graph matching is a good way to align a pair of shapesrepresented by a set of descriptive local features; the set ofcorrespondences produced by the minimum cost of matching features fromone shape to the features ...
    • Fast Rates for Regularized Least-squares Algorithm 

      Caponnetto, Andrea; Vito, Ernesto De (2005-04-14)
      We develop a theoretical analysis of generalization performances of regularized least-squares on reproducing kernel Hilbert spaces for supervised learning. We show that the concept of effective dimension of an integral ...
    • Fast Self-Healing Gradients 

      Beal, Jacob; Bachrach, Jonathan; Vickery, Dan; Tobenkin, Mark (2008-03)
      We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Self-healing gradients are a frequently used building block for distributed self-healing systems, but previous ...
    • Fast, Approximate State Estimation of Concurrent Probabilistic Hybrid Automata 

      Timmons, Eric (2013-12-11)
      It is an undeniable fact that autonomous systems are simultaneously becoming more common place, more complex, and deployed in more inhospitable environments. Examples include smart homes, smart cars, Mars rovers, unmanned ...
    • Faster Dynamic Controllability Checking in Temporal Networks with Integer Bounds 

      Bhargava, Nikhil; Williams, Brian C. (International Joint Conference in Artificial Intelligence, 2019-08)
      Simple Temporal Networks with Uncertainty (STNUs) provide a useful formalism with which to reason about events and the temporal constraints that apply to them. STNUs are in particular notable because they facilitate reasoning ...
    • A File Location, Replication, and Distribution System for Network Information to Aid Network Management 

      Cheng, Tiffany (2010-09-22)
      This thesis demonstrates and evaluates the design, architecture, and implementation of a file location, replication, and distribution system built with the objective of managing information in an Internet network. The ...
    • File Synchronization with Vector Time Pairs 

      Cox, Russ; Josephson, William (2005-02-28)
      Vector time pairs are a new method for trackingsynchronization metadata. A vector time pairconsists of two vector times: one tracking filemodification history and one tracking filesynchronization history. Because the ...
    • Filtered Iterators For Safe and Robust Programs in RIFL 

      Shen, Jiasi; Rinard, Martin (2015-12-27)
      We present a new language construct, filtered iterators, for safe and robust input processing. Filtered iterators are designed to eliminate many common input-processing errors while enabling robust continued execution. The ...
    • Finding aircraft collision-avoidance strategies using policy search methods 

      Kaelbling, Leslie Pack; Lozano-Perez, Tomas (2009-09-12)
      A progress report describing the application of policy gradient and policy search by dynamic programming methods to an aircraft collision avoidance problem inspired by the requirements of next-generation TCAS.
    • Finding Bugs In Dynamic Web Applications 

      Artzi, Shay; Kiezun, Adam; Dolby, Julian; Tip, Frank; Dig, Danny; e.a. (2008-02-06)
      Web script crashes and malformed dynamically-generated web pages are common errors, and they seriously impact usability of web applications. Currenttools for web-page validation cannot handle the dynamically-generatedpages ...
    • Finding Bugs in Web Applications Using Dynamic Test Generation and Explicit State Model Checking 

      Tip, Frank; Ernst, Michael D.; Dig, Danny; Dolby, Julian; Kiezun, Adam; e.a. (2009-03-26)
      Web script crashes and malformed dynamically-generated web pages are common errors, and they seriously impact the usability of web applications. Current tools for web-page validation cannot handle the dynamically generated ...
    • Finding Longest Increasing and Common Subsequences in Streaming Data 

      Liben-Nowell, David; Vee, Erik; Zhu, An (2003-11-26)
      In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence(LIS) and Longest Common Subsequence (LCS) problems in the data streaming model.
    • Finding the needles in the haystack: Generating legal test inputs for object-oriented programs 

      Artzi, Shay; Ernst, Michael D.; Kiezun, Adam; Pacheco, Carlos; Perkins, Jeff H. (2006-08-31)
      A test input for an object-oriented program typically consists of asequence of method calls that use the API defined by the programunder test. Generating legal test inputs can be challenging because,for some programs, the ...
    • Finite Horizon Control Design for Optimal Discrimination between Several Models 

      Blackmore, Lars; Williams, Brian (2006-02-28)
      Multiple-Model fault detection is a powerful method for detecting changes, such as faults, in dynamic systems. In many cases, the ability of such a detection scheme to distinguish between possible models for the system ...
    • First Class Copy & Paste 

      Edwards, Jonathan (2006-05-22)
      The Subtext project seeks to make programming fundamentally easier by altering the nature of programming languages and tools. This paper defines an operational semantics for an essential subset of the Subtext language. It ...