Search
Now showing items 41-50 of 101
Dealers, Insiders and Bandits: Learning and its Effects on Market Outcomes
(2006-07-12)
This thesis seeks to contribute to the understanding of markets populated by boundedly rational agents who learn from experience. Bounded rationality and learning have both been the focus of much research in computer ...
Robust Execution of Bipedal Walking Tasks From Biomechanical Principles
(2006-04-28)
Effective use of robots in unstructured environments requires that they have sufficient autonomy and agility to execute task-level commands successfully. A challenging example of such a robot is a bipedal walking machine. ...
New Techniques for Geographic Routing
(2006-06-14)
As wireless sensor networks continue to grow in size, we are facedwith the prospect of emerging wireless networks with hundreds orthousands of nodes. Geographic routing algorithms are a promisingalternative to tradition ...
Was the Patient Cured? Understanding Semantic Categories and Their Relationships in Patient Records
(2006-06-28)
In this thesis, we detail an approach to extracting key information in medical discharge summaries. Starting with a narrative patient report, we first identify and remove information that compromises privacy (de-identifi ...
MORE: A Network Coding Approach to Opportunistic Routing
(2006-06-30)
Opportunistic routing has the potential to substantially increase wireless network throughput. Prior work on opportunistic routing, however, requires tight node coordination. Different nodes in a network must have knowledge ...
Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-19)
We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automataframework of Lynch, Segala, and Vaandrager. This framework providestools for arguing rigorously ...
Iterative Collaborative Ranking of Customers and Providers
(2006-07-04)
This paper introduces a new application: predicting the Internet provider-customer market. We cast the problem in the collaborative filtering framework, where we use current and past customer-provider relationships to ...
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2006-06-20)
The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about theircorrectness using multiple levels of abstraction, based on implementation ...
Approximate Correspondences in High Dimensions
(2006-06-15)
Pyramid intersection is an efficient method for computing an approximate partial matching between two sets of feature vectors. We introduce a novel pyramid embedding based on a hierarchy of non-uniformly shaped bins that ...
A Unified Information Theoretic Framework for Pair- and Group-wise Registration of Medical Images
(2006-01-25)
The field of medical image analysis has been rapidly growing for the past two decades. Besides a significant growth in computational power, scanner performance, and storage facilities, this acceleration is partially due ...