Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 2283-2302 of 3804
-
On Concurrent Identification Protocols
(1983-12)We consider communication networks in which it is not possible to identify the source of a message which is broadcastes through the network. A natural question is whether it is possible for two users to identify each other ... -
On Consulting a Set of Experts and Searching
(1996-09)Two chapters of this thesis analyze expert consulting problemas via game theoretic models; the first points out a close connectionn between the problem of consulting a set of experts and the problem of searching. The last ... -
On Convergence Properties of the EM Algorithm for Gaussian Mixtures
(1995-04-21)"Expectation-Maximization'' (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a ... -
On Data Bases with Incomplete Information
(1979-10)Semantic and logical problems arising in an incomplete information data base are investigated. A simple query language is described and its semantics is defined, which refers the queries to the information about reality ... -
On Database Management System Architecture
(1979-10)Despite the many advances that have been made in the field of database management in the last two decades, in many respects the paradigm of database management has not changed much since its inception. Several long-standing ... -
On Decision Procedures for Set-Value Fields
(2004-11-30)An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ... -
On Degeneracy of Linear Reconstruction from Three Views: Linear Line Complex and Applications
(1997-12-01)This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of equations for recovering the trilinear tensor ... -
On Directional Selectivity in Vertebrate Retina: An Experimental and Computational Study
(1992-01-01)This thesis describes an investigation of retinal directional selectivity. We show intracellular (whole-cell patch) recordings in turtle retina which indicate that this computation occurs prior to the ganglion cell, ... -
On Dynamic Models of Robot Force Control
(1986-07-01)For precise robot control, endpoint compliance strategies utilize feedback from a force sensor located near the tool/workpiece interface. Such endpoint force control systems have been observed in the laboratory to be ... -
On Edge Detection
(1984-08-01)Edge detection is the process that attempts to characterize the intensity changes in the image in terms of the physical processes that have originated them. A critical, intermediate goal of edge detection is the detection ... -
On Field Constraint Analysis
(2005-11-03)We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints ... -
On Generalized Records and Spatial Conjunction in Role Logic
(2004-04-06)We have previously introduced role logic as a notation fordescribing properties of relational structures in shapeanalysis, databases and knowledge bases. A natural fragmentof role logic corresponds to two-variable logic ... -
On Interpreting Stereo Disparity
(1989-02-01)The problems under consideration center around the interpretation of binocular stereo disparity. In particular, the goal is to establish a set of mappings from stereo disparity to corresponding three-dimensional scene ... -
On Lightness
(1973-10-01)The intensity at a point in an image is the product of the reflectance at the corresponding object point and the intensity of illumination at that point. We are able to perceive lightness, a quantity closely correlated ... -
On Linear Characterizations of Combinatorial Optimization Problems
(1980-02)We show that there can be no computationally tractable description by linear inequalities of the polyhedron associated with any NP-complete combinatorial optimization problem unless NP=co-NP -- a very unlikely event. We ... -
On Lower Bounds for Selection Problems
(1974-03)Let V i (n) be the minimum number of binary comparisons that are required to determine the i-th largest of n elements drawn from a totally ordered set. In this thesis we use adversary strategies to prove lower bounds on ... -
On Memory Limitations in Natural Language Processing
(1980-09)This paper proposes a welcome hypothesis: a computationally simple device is sufficient for processing natural language. Traditionally it has been argued that processing natural language syntax requires very powerful ... -
On Modular Pluggable Analyses Using Set Interfaces
(2003-12-18)We present a technique that enables the focused applicationof multiple analyses to different modules in the same program. Our researchhas two goals: 1) to address the scalability limitations of preciseanalyses by focusing ... -
On Motion Planning with Uncertainty
(1984-08-01)Robots must successfully plan and execute tasks in the presence of uncertainty. Uncertainty arises from errors in modeling, sensing, and control. Planning in the presence of uncertainty constitutes one facet of the ... -
On Multiple Moving Objects
(1986-05-01)This paper explores the motion planning problem for multiple moving objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the ...
