Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 2384-2403 of 3804
-
Operation of a Semantic Question-Answering System
(1963-11-01)A computer program has been written in the LISP programming language which accepts information and answers questions presented to it in a restricted form of natural English language. The program achieves its effects by ... -
Operational Semantics of a Data Flow Language
(1978-12)A data flow machine achieves high performance by the concurrent execution of machine code consisting of data flow graphs which explicitly represent the data dependencies among program instructions. This thesis presents the ... -
An Operator Embedding Theorem for Complexity Classes of Recursive Functions
(1973-05)Let F (t) be the set of functions computable by some machine using no more than t(x) machine steps on all but finitely many arguments x. If we order the - classes under set inclusion as t varies over the recursive functions, ... -
OPL-I An Open Ended Programming System Within CTSS
(1964-01)OPL-1, an incremental programming system presently operating with CTSS, permits the user to augment both his program and his data base during widely separated successive sessions at his terminal. Facilities are provided ... -
OpLog: a library for scaling update-heavy data structures
(2014-09-16)Existing techniques (e.g., RCU) can achieve good multi-core scaling for read-mostly data, but for update-heavy data structures only special-purpose techniques exist. This paper presents OpLog, a general-purpose library ... -
Opportunistic Log: Efficient Installation Reads in a Reliable Object Server
(1994-04)In a distributed storage system, client caches managed on the basis of small granularity objects can provide better memory utilization then page-based caches. However, object servers, unlike page servers, must perform ... -
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 ...
