Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 2390-2409 of 3804
-
The OPS-1 Manual
(1964-05)The recent attainment and continuing development of personally accessible computer facilities have opened another chapter in the use of machines by man. A number of current research efforts, including Project MAC at M.I.T., ... -
Optical Flow From 1D Correlation: Application to a Simple Time-To-Crash Detector
(1993-10-01)In the first part of this paper we show that a new technique exploiting 1D correlation of 2D or even 1D patches between successive frames may be sufficient to compute a satisfactory estimation of the optical flow field. ... -
The Optical Flow of Planar Surfaces
(1985-12-01)The human visual system can recover the 3D shape of moving objects on the basis of motion information alone. Computational studies of this capacity have considered primarily non-planar rigid objects. With respect to ... -
Optimal and Player-Replaceable Consensus with an Honest Majority
(2017-03-31)We construct a Byzantine Agreement protocol that tolerates t < n/2 corruptions, is very efficient in terms of the number of rounds and the number of bits of communication, and satisfies a strong notion of robustness called ... -
Optimal Approximations of the Frequency Moments
(2004-07-02)We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, ... -
Optimal Approximations of the Frequency Moments
(2004-07-02)We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, ... -
Optimal Arrangement of Keys in a Hash Table
(1976-07)When open addressing is used to resolve collisions in a hash table, a given set of keys may be arranged in many ways; typically this depends on the order in which the keys are inserted. We show that arrangements minimizing ... -
Optimal Bayesian Estimators for Image Segmentation and Surface Reconstruction
(1985-04-01)sA very fruitful approach to the solution of image segmentation andssurface reconstruction tasks is their formulation as estimationsproblems via the use of Markov random field models and Bayes theory.sHowever, the ... -
Optimal Bidirectional Rapidly-Exploring Random Trees
(2013-08-15)In this paper we present a simple, computationally-efficient, two-tree variant of the RRT* algorithm along with several heuristics. -
Optimal Clock Synchronization Under Different Delay Assumptions
(1994-04)The problem of achieving optimal clock synchronization in a communication network with arbitrary topology and perfect clocks (that do not drift) is studied. Clock synchronization algorithms are presented for a large family ... -
Optimal Distributed Algorithms for Sorting and Ranking
(1984-05)We study the problems of sorting and ranking n processors that have initial values - not necessarily distinct - in a distrubuted system. Sorting means that the initial values have to move around in the network and be ... -
Optimal Parametric Auctions
(2012-05-08)We study the problem of profit maximization in auctions of one good where the buyers' valuations are drawn from independent distributions. When these distributions are known to the seller, Myerson's optimal auction is a ... -
Optimal Parametric Auctions
(2012-06-14)We study the problem of an auctioneer who wants to maximize her profits. In our model, there are n buyers with private valuations drawn from independent distributions F_1,...,F_n. When these distributions are known to the ... -
Optimal Placement for River Routing
(1981-10)Programs for integrated circuit layout typically have two phases: placement and routing. The router should produce as efficient a layout as possible, but of course the quality of the routhing depends heavily on the quality ... -
Optimal Rates for Regularization Operators in Learning Theory
(2006-09-10)We develop some new error bounds for learning algorithms induced by regularization methods in the regression setting. The "hardness" of the problem is characterized in terms of the parameters r and s, the first related ... -
An Optimal Scale for Edge Detection
(1988-09-01)Many problems in early vision are ill posed. Edge detection is a typical example. This paper applies regularization techniques to the problem of edge detection. We derive an optimal filter for edge detection with a ... -
Optimal Temporal Planning at Reactive Time Scales via Dynamic Backtracking Branch and Bound
(2006-08-25)Autonomous robots are being considered for increasingly capable roles in our society, such as urban search and rescue, automation for assisted living, and lunar habitat construction. To fulfill these roles, teams of ... -
Optimal Unsupervised Learning in Feedforward Neural Networks
(1989-01-01)We investigate the properties of feedforward neural networks trained with Hebbian learning algorithms. A new unsupervised algorithm is proposed which produces statistically uncorrelated outputs. The algorithm causes ... -
An Optimality Theory of Concurrency Control for Databases
(1980-11)A concurrency control mechanism (or a scheduler) is the component of a database system that safeguards the consistency of the database in the presence of interleaved accesses and update requests. We formally show that the ... -
Optimism vs. Locking: A Study of Concurrency Control for Client-Server Object-Oriented Databases
(1997-01)Many client-server object-oriented database systems (OODBs) run applications at clients and perform all accesses on cached copies of database objects. Moving both data and computation to the clients can improve response ...
