Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1042-1061 of 3804
-
Efficient Cache Coherence on Manycore Optical Networks
(2010-02-11)Ever since industry has turned to parallelism instead of frequency scaling to improve processor performance, multicore processors have continued to scale to larger and larger numbers of cores. Some believe that multicores ... -
Efficient Consistency Proofs on a Committed Database
(2003-02)A consistent query protocol allows a database owner to publish a very short string c which commits her to a particular database D with special consistency property (i.e., given c, every allowable query has unique and ... -
An Efficient Correspondence Based Algorithm for 2D and 3D Model Based Recognition
(1990-10-01)A polynomial time algorithm (pruned correspondence search, PCS) with good average case performance for solving a wide class of geometric maximal matching problems, including the problem of recognizing 3D objects from ... -
Efficient Demand-Driven Evaluation (I)
(1983-09)We describe a program transformation technique for programs in a general stream language L whereby a data-driven evaluation of the transformed program performs exactly the same computation as a demand-driven evaluation of ... -
Efficient Demand-Driven Evaluation (II)
(1983-09)In Part I of this paper, we presented a scheme whereby a compiler could propogate demands through programs in a powerful stream language L. A data-driven evaluation of the transformed program performed exactly the same ... -
An Efficient Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats
(2017-06-09)Tensors, linear-algebraic extensions of matrices in arbitrary dimensions, have numerous applications in computer science and computational science. Many tensors are sparse, containing more than 90% zero entries. Efficient ... -
Efficient Garbage Collection for Large Object-Oriented Databases
(1996-05)This thesis presents the design of an efficient garbage collection scheme for large, persistent object-oriented databases in a client-server environment. The scheme uses a partitioned approach. A database is divided into ... -
Efficient Image Matching with Distributions of Local Invariant Features
(2004-11-22)Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature sets' similarity via a voting scheme (which ... -
An Efficient Implementation of A Hierarchical Weighted Fair Queue Packet Scheduler
(1994-05)The technical developments in computer networks in recent years have spawned the possibility of merging different services into a single Integrated Service Packet Network (ISPN). The types of service quality required by ... -
Efficient Implementation of Applicative Languages
(1984-04)The analysis of parallelism in an applicative program is much easier than in a program written in a conventional statement-oriented style. This makes it possible for an optimizing compiler to prepare such a program for ... -
Efficient Implementation of High-Level Languages on User-Level Communications Architectures
(1994-05)User-level communication architectures --- parallel architectures that give user code direct but protected access to the network --- provide communication performance that is an order of magnitude higher than previous-generation ... -
An Efficient Learning Procedure for Deep Boltzmann Machines
(2010-08-04)We present a new learning algorithm for Boltzmann Machines that contain many layers of hidden variables. Data-dependent statistics are estimated using a variational approximation that tends to focus on a single mode, and ... -
Efficient Marginal Likelihood Optimization in Blind Deconvolution
(2011-04-04)In blind deconvolution one aims to estimate from an input blurred image y a sharp image x and an unknown blur kernel k. Recent research shows that a key to success is to consider the overall shape of the posterior distribution ... -
Efficient Methods for Calculating Maximum Entropy Distributions
(1987-05)We present a new algorithm for computing the maximum entropy probability distribution satisfying a set of constraints. Unlike previous approaches, our method is integrated with the planning of data collection and tabulation. ... -
Efficient Modeling for Short Channel MOS Circuit Cimulation
(1982-08)Existing circuit models for short-channel MOS transistors represent a compromise between speed and ease of use. Empirical models are very fast to evaluate, but their parameters must be fitted from experimental measurements. ... -
Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
(2008-03-06)When controlling dynamic systems such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster by taking a more challenging path. This paper ... -
Efficient Object Recognition and Image Retrieval for Large-Scale Applications
(2008-05-06)Algorithms for recognition and retrieval tasks generally call for both speed and accuracy. When scaling up to very large applications, however, we encounter additional significant requirements: adaptability and scalability. ...