Browsing CSAIL Digital Archive by Title
Now showing items 425-444 of 806
-
Marriage, Honesty, and Stability
(2003-07-28)Many centralized two-sided markets form a matching between participantsby running a stable marriage algorithm. It is a well-knownfact that no matching mechanism based on a stable marriage algorithmcan guarantee truthfulness ... -
Matching Sets of Features for Efficient Retrieval and Recognition
(2006-08-11)In numerous domains it is useful to represent a single example by the collection of local features or parts that comprise it. In computer vision in particular, local image features are a powerful way to describe images of ... -
Materialization Strategies in a Column-Oriented DBMS
(2006-11-27)There has been renewed interest in column-oriented database architectures in recent years. For read-mostly query workloads such as those found in data warehouse and decision support applications, ``column-stores'' have ... -
Mathematics of the Neural Response
(2008-11-26)We propose a natural image representation, the neural response, motivated by the neuroscience of the visual cortex. The inner product defined by the neural response leads to a similarity measure between functions which we ... -
Matrix Approximation and Projective Clustering via Iterative Sampling
(2005-03-29)We present two new results for the problem of approximating a given real m by n matrix A by a rank-k matrix D, where k < min{m, n}, so as to minimize ||A-D||_F^2. It is known that bysampling O(k/eps) rows of the matrix, ... -
Maximum Entropy Correlated Equilibria
(2006-03-20)We study maximum entropy correlated equilibria in (multi-player)games and provide two gradient-based algorithms that are guaranteedto converge to such equilibria. Although we do not provideconvergence rates for these ... -
Mechanism Design With Approximate Player Types
(2011-02-16)We investigate mechanism design when the players do not exactly know their types, but have instead only partial information about them. -
Mechanism Design with Approximate Valuations
(2011-02-16)In mechanism design, we replace the strong assumption that each player knows his own payoff type EXACTLY with the more realistic assumption that he knows it only APPROXIMATELY. Specifically, we study the classical problem ... -
Memoization Attacks and Copy Protection in Partitioned Applications
(2006-12-08)Application source code protection is a major concern for software architects today. Secure platforms have been proposed that protect the secrecy of application algorithms and enforce copy protection assurances. Unfortunately, ... -
A Method for Fast, High-Precision Characterization of Synthetic Biology Devices
(2012-04-07)Engineering biological systems with predictable behavior is a foundational goal of synthetic biology. To accomplish this, it is important to accurately characterize the behavior of biological devices. Prior characterization ... -
Methods and Experiments With Bounded Tree-width Markov Networks
(2004-12-30)Markov trees generalize naturally to bounded tree-width Markov networks, onwhich exact computations can still be done efficiently. However, learning themaximum likelihood Markov network with tree-width greater than 1 is ... -
Middleboxes No Longer Considered Harmful
(2004-06-24)Intermediate network elements, such as network address translators (NATs), firewalls, and transparent caches are now commonplace. The usual reaction in the network architecture community to these so-called middleboxes is ... -
MIXIT: The Network Meets the Wireless Channel
(2007-09-04)The traditional contract between the network and the lower layers states that the network does routing and the lower layers deliver correct packets. In a wireless network, however, different nodes may hear most bits in a ... -
Mobilized ad-hoc networks: A reinforcement learning approach
(2003-12-04)Research in mobile ad-hoc networks has focused on situations in whichnodes have no control over their movements. We investigate animportant but overlooked domain in which nodes do have controlover their movements. ... -
Modeling Computational Security in Long-Lived Systems, Version 2
(2008-11-22)For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressively over the lifetime of a protocol. However, some ... -
Modeling Network User Behavior: Various Approaches
(2016-06-28)This project involves learning to predict users' mobility within the network topology. Topological mobility, as opposed to physical mobility, can be substantial as a user switches from LTE to wifi network, while moving ... -
Modeling Radio Networks
(2009-06-04)We describe a modeling framework and collection of foundational composition results for the study of probabilistic distributed algorithms in synchronous radio networks. Existing results in this setting rely on informal ... -
Modular Generation and Customization
(2008-10-10)Modularity and flexibility can conflict in multi-language systems. For example, the templates commonly used to generate web pages must be manually updated when the database schema changes. Modularity can be improved by ... -
Moebius Language Reference, Version 1.2
(2014-04-09)Moebius is a representation and interface language based on a subset of English. It is designed for use as a means of encoding information and as a means of conveying information between software components and other ... -
Monitoring the Execution of Temporal Plans for Robotic Systems
(2012-10-04)To achieve robustness in dynamic and uncertain environments, robotic systems must monitor the progress of their plans during execution. This thesis develops a plan executive called Pike that is capable of executing and ...
