Search
Now showing items 821-830 of 4210
PPR: Partial Packet Recovery for Wireless Networks
(2007-02-02)
Bit errors occur over wireless channels when the signal isn't strongenough to overcome the effects of interference and noise. Currentwireless protocols may use forward error correction (FEC) to correct forsome (small) ...
Trading Structure for Randomness in Wireless Opportunistic Routing
(2007-02-23)
Opportunistic routing is a recent technique that achieves high throughput in the face of lossy wireless links. The current opportunistic routing protocol, ExOR, ties the MAC with routing, imposing a strict schedule on ...
Embracing Wireless Interference: Analog Network Coding
(2007-02-23)
Traditionally, interference is considered harmful.Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages ...
Information Slicing: Anonymity Using Unreliable Overlays
(2007-02-23)
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the public keys of the nodes along the path. ...
HQ Replication: Properties and Optimizations
(2007-02-12)
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas to agree on a proposed ordering of requests, ...
Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol
(2007-02-16)
The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on implementation ...
Automatic shaping and decomposition of reward functions
(2007-02-13)
This paper investigates the problem of automatically learning how torestructure the reward function of a Markov decision process so as tospeed up reinforcement learning. We begin by describing a method thatlearns a shaped ...
Mapping Stream Programs into the Compressed Domain
(2007-11-30)
Due to the high data rates involved in audio, video, and signalprocessing applications, it is imperative to compress the data todecrease the amount of storage used. Unfortunately, this implies thatany program operating on ...
Transfering Nonlinear Representations using Gaussian Processes with a Shared Latent Space
(2007-11-06)
When a series of problems are related, representations derived fromlearning earlier tasks may be useful in solving later problems. Inthis paper we propose a novel approach to transfer learning withlow-dimensional, non-linear ...
Towards Feature Selection In Actor-Critic Algorithms
(2007-11-01)
Choosing features for the critic in actor-critic algorithms with function approximation is known to be a challenge. Too few critic features can lead to degeneracy of the actor gradient, and too many features may lead to ...