Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

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

Sort by: Order: Results:

  • Karger, David; Nikolova, Evdokia (2008-01-28)
    The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an adaptive policy (adjusting as one learns more ...
  • Meyers, Ethan; Embark, Hamdy; Freiwald, Winrich; Serre, Thomas; Kreiman, Gabriel; Poggio, Tomaso (2010-07-29)
    Humans and other primates can rapidly categorize objects even when they are embedded in complex visual scenes (Thorpe et al., 1996; Fabre-Thorpe et al., 1998). Studies by Serre et al., 2007 have shown that the ability of ...
  • Beverly, Robert; Sollins, Karen (2008-02-15)
    In the arms race to secure electronic mail users and servers fromunsolicited messages (spam), the most successful solutions employtechniques that are difficult for spammers to circumvent. Thisresearch investigates the ...
  • Larsen, Sam; Rabbah, Rodric; Amarasinghe, Saman (2005-06-03)
    An emerging trend in processor design is the incorporation of short vector instructions into the ISA. In fact, vector extensions have appeared in most general-purpose microprocessors. To utilize these instructions, ...
  • Kumpf, Adam (2007-01-30)
    This thesis presents the findings of exploratory research in low-cost compliant robotics. The most heavily leveraged trade-off is that of mechanical precision for computational power, with the hope that the price of future ...
  • Benjamin, Michael R.; Newman, Paul M.; Schmidt, Henrik; Leonard, John J. (2009-08-20)
    This document describes how to extend the suite of MOOS applications and IvP Helm behaviors distributed with the MOOS-IvP software bundle from www.moos-ivp.org. It covers (a) a straw-man repository with a place-holder MOOS ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Paris, Sylvain; Hasinoff, Samuel W.; Kautz, Jan; Aubry, Mathieu; 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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.
  • Artzi, Shay; Kiezun, Adam; Dolby, Julian; Tip, Frank; Dig, Danny; Paradkar, Amit; Ernst, Michael D. (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 ...
  • Tip, Frank; Ernst, Michael D.; Dig, Danny; Dolby, Julian; Kiezun, Adam; Artzi, Shay; Paradkar, Amit (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 ...
  • 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.
MIT-Mirage