Browsing CSAIL Digital Archive by Title
Now showing items 523-542 of 806
-
Optimal Parametric Auctions
(2012-06-14)We study the problem of an auctioneer who wants to maximize her profits. In our model, there are n buyers with private valuations drawn from independent distributions F_1,...,F_n. When these distributions are known to the ... -
Optimal Rates for Regularization Operators in Learning Theory
(2006-09-10)We develop some new error bounds for learning algorithms induced by regularization methods in the regression setting. The "hardness" of the problem is characterized in terms of the parameters r and s, the first related ... -
Optimal Temporal Planning at Reactive Time Scales via Dynamic Backtracking Branch and Bound
(2006-08-25)Autonomous robots are being considered for increasingly capable roles in our society, such as urban search and rescue, automation for assisted living, and lunar habitat construction. To fulfill these roles, teams of ... -
Optimizing MapReduce for Multicore Architectures
(2010-05-02)MapReduce is a programming model for data-parallel programs originally intended for data centers. MapReduce simplifies parallel programming, hiding synchronization and task management. These properties make it a promising ... -
The Order Independence of Iterated Dominance in Extensive Games, with Connections to Mechanism Design and Backward Induction
(2012-07-31)Shimoji and Watson (1998) prove that a strategy of an extensive game is rationalizable in the sense of Pearce if and only if it survives the maximal elimination of conditionally dominated strategies. Briefly, this process ... -
Organic Indoor Location Discovery
(2008-12-30)We describe an indoor, room-level location discovery method based on spatial variations in "wifi signatures," i.e., MAC addresses and signal strengths of existing wireless access points. The principal novelty of our system ... -
Organon: A Symbolic Constraint Framework & Solver
(2013-05-24)Organon is an open source system for expressing and solving complex symbolic constraints between generic entities. Our design avoids restricting the programmer s ability to phrase constraints; Organon acts purely as a ... -
Outlier Detection in Heterogeneous Datasets using Automatic Tuple Expansion
(2016-02-08)Rapidly developing areas of information technology are generating massive amounts of data. Human errors, sensor failures, and other unforeseen circumstances unfortunately tend to undermine the quality and consistency of ... -
Overcoming the Antennas-Per-Node Throughput Limit in MIMO LANs
(2009-02-18)Today, the number of concurrent packets in a MIMO LAN is limited by the number of antennas on the AP. This paper shows how to overcome this limit. It presents a new design where multiple client-AP pairs can communicate ... -
An Overview of MOOS-IvP and a Brief Users Guide to the IvP Helm Autonomy Software
(2009-06-18)This document describes the IvP Helm - an Open Source behavior-based autonomy application for unmanned vehicles. IvP is short for interval programming - a technique for representing and solving multi-objective optimizations ... -
An Overview of MOOS-IvP and a Users Guide to the IvP Helm - Release 4.2.1
(2011-08-03)This document describes the IvP Helm - an Open Source behavior-based autonomy application for unmanned vehicles. IvP is short for interval programming - a technique for representing and solving multi-objective optimizations ... -
An Overview of MOOS-IvP and a Users Guide to the IvP Helm Autonomy Software
(2010-08-27)This document describes the IvP Helm -- an Open Source behavior-based autonomy application for unmanned vehicles. IvP is short for interval programming -- a technique for representing and solving multi-objective optimizations ... -
Parallelizing Sequential Programs With Statistical Accuracy Tests
(2010-08-05)We present QuickStep, a novel system for parallelizing sequential programs. QuickStep deploys a set of parallelization transformations that together induce a search space of candidate parallel programs. Given a sequential ... -
Partial Reversal Acyclicity
(2011-04-14)Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving ... -
Partitioning Strategies for Concurrent Programming
(2009-06-16)This work presents four partitioning strategies, or patterns, useful for decomposing a serial application into multiple concurrently executing parts. These partitioning strategies augment the commonly used task and data ... -
Patch complexity, finite pixel correlations and optimal denoising
(2012-10-07)Image restoration tasks are ill-posed problems, typically solved withpriors. Since the optimal prior is the exact unknown density of natural images,actual priors are only approximate and typically restricted to small ... -
Perfect and General Virtual Implementation For Perfectly Informed Players
(2009-12-04)We show that, when the players are perfectly informed about each other, essentially all social-choice functions can be rationally robustly implemented via an extensive-form public-action mechanism that (1) is perfectly ... -
Perfect Implementation of Normal-Form Mechanisms
(2007-03)Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ... -
Perfect Implementation of Normal-Form Mechanisms
(2005)Privacy and trust affect our strategic thinking, yet they have not been precisely modeled in mechanism design. In settings of incomplete information, traditional implementations of a normal-form mechanism ---by disregarding ... -
Performance and error analysis of three part of speech taggers on health texts
(2010-02-25)Increasingly, natural language processing (NLP) techniques are being developed and utilized in a variety of biomedical domains. Part of speech tagging is a critical step in many NLP applications. Currently, we are developing ...
