Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 2759-2778 of 3804
-
RABBIT: A Compiler for SCHEME
(1978-05-01)We have developed a compiler for the lexically-scoped dialect of LISP known as SCHEME. The compiler knows relatively little about specific data manipulation primitives such as arithmetic operators, but concentrates ... -
A Radial Basis Function Approach to Financial Time Series Analysis
(1993-12-01)Nonlinear multivariate statistical techniques on fast computers offer the potential to capture more of the dynamics of the high dimensional, noisy systems underlying financial markets than traditional models, while ... -
RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks
(2003-03)Future civilian rescue and military operations will depend on a complex system of communicating devices that can operate in highly dynamic environments. In order to present a consistent view of a complex world, these devices ... -
RamboNodes for the Metropolitan Ad Hoc Network
(2003-12-17)We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ... -
RamboNodes for the Metropolitan Ad Hoc Network
(2003-12-17)We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ... -
Random Lens Imaging
(2006-09-02)We call a random lens one for which the function relating the input light ray to the output sensor location is pseudo-random. Imaging systems with random lensescan expand the space of possible camera designs, allowing new ... -
A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication
(1997-04)Private information retrieval (PIR) schemes provide a user with information from a database while keeping his query secret from the database manager. We propose a new model for PIR, utilizing auxiliary random servers ... -
Random-World Semantics and Syntactic Independence for Expressive Languages
(2008-05-03)We consider three desiderata for a language combining logic and probability: logical expressivity, random-world semantics, and the existence of a useful syntactic condition for probabilistic independence. Achieving these ... -
A Randomized Data Structure for Ordered Sets
(1986-05)In this paper, we consider a simple randomized data structure for representing ordered sets, and give a precise combinatorial analysis of the time required to perform various operations. In addition to a practical data ... -
Randomized Encryption Techniques
(1983-01)A randomized encryption procedure enciphers a message by randomly choosing a ciphertext from a set of ciphertexts corresponding to the message under the current encryption key. At the cost of increasing the required ... -
Randomized Routing on Fat-trees
(1986-05)Fat-trees are a class of routing networks for hardware-efficient paralle computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the ... -
Randomness and Robustness in Hypercube Computation
(1991-04)In this thesis we explore means by which hypercubes can compute despite faulty processors and links. We also study techniques which enable hypercubes to simulate dynamically changing networks and data structures. -
Randomness Versus Non-Determinism in Distributed Computing
(1994-10)This thesis is devoted to the analysis and illustration of the effects of the interplay between randomness and non-determinism in randomized computing. Using ideas from game theory , we provide a general model for randomized ... -
Range Segmentation Using Visibility Constraints
(2001-09-01)Visibility constraints can aid the segmentation of foreground objects observed with multiple range images. In our approach, points are defined as foreground if they can be determined to occlude some {em empty space} in the ... -
Rank 2 Type Systems and Recursive Definitions
(1995-11)We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence ... -
Rank 2 Type Systems and Recursive Definitions
(1995-08)We demonstrate an equivalence between the rank 2 fragments of the polymorphic lambda calculus (System F) and the intersection type discipline: exactly the same terms are typable in each system. An immediate consequence is ... -
Rank Priors for Continuous Non-Linear Dimensionality Reduction
(2008-09-26)Non-linear dimensionality reduction methods are powerful techniques to deal with high-dimensional datasets. However, they often are susceptible to local minima and perform poorly when initialized far from the global optimum, ... -
Rate-based Congestion Control in Networks with Smart Links
(1990-01)I use a network simulator to explore rate-based congestion control in networks with "smart" links that can feed back information to tell senders to adjust their transmission rates. This method differs in a very important ...
