Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title
Now showing items 271-290 of 775
-
Fast Rates for Regularized Least-squares Algorithm
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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 ... -
Fleets: Scalable Services in a Factored Operating System
(2011-03-09)Current monolithic operating systems are designed for uniprocessor systems, and their architecture reflects this. The rise of multicore and cloud computing is drastically changing the tradeoffs in operating system design. ... -
Flexible Execution of Plans with Choice and Uncertainty
(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
(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
(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
(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
(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 ...