Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title
Now showing items 1106-1125 of 3804
-
Enhanced Visual Authoring Using Operation History
(2009-06-24)Graphical editors have introduced great flexibility to the designer's workflow, providing powerful digital tools and enabling the creation of complex and compelling designs. This thesis presents methods for improving these ... -
Enhancing Availability and Security Through Failure-Oblivious Computing
(2004-02-06)We present a new technique, failure-oblivious computing,that enables programs to continue to execute through memoryerrors without memory corruption. Our safe compilerfor C inserts checks that dynamically detect invalid ... -
Enhancing the Dexterity of a Robot Hand Using Controlled Slip
(1987-05-01)Humans can effortlessly manipulate objects in their hands, dexterously sliding and twisting them within their grasp. Robots, however, have none of these capabilities, they simply grasp objects rigidly in their end ... -
EpiChord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management
(2004-08-13)EpiChord is a DHT lookup algorithm that demonstrates that we canremove the O(log n)-state-per-node restriction on existing DHTtopologies to achieve significantly better lookup performance andresilience using a novel reactive ... -
Epistemic Implementation and The Arbitrary-Belief Auction
(2012-06-22)In settings of incomplete information we put forward an epistemic framework for designing mechanisms that successfully leverage the players' arbitrary higher-order beliefs, even when such beliefs are totally wrong, and ... -
EPS: An Interactive System for Solving Elliptic Boundary-Value Problems with Facilities for Data Manipulation
(1969-06)This appendix for the author's forthcoming thesis, "On-Line Solution of Elliptic Boundary-Value Problems," is a user's guide for EPS. EPS solves two-dimensional boundary-value problems for elliptic systems of second-order ... -
Equation Counting and the Interpretation of Sensory Data
(1981-06-01)Many problems in biological information processing require the solution to a complex system of equations in many unknown variables. An equation-counting procedure is described for determining whether such a system of ... -
Equational Theories and Database Constraints
(1985-08)The implication problem for database constraints is central in the fields of automated schema design and query optimization and has been traditionally approached with resolution-based techniques. We present a novel approach ... -
Equivalence and Reduction of Hidden Markov Models
(1993-01-01)This report studies when and why two Hidden Markov Models (HMMs) may represent the same stochastic process. HMMs are characterized in terms of equivalence classes whose elements represent identical stochastic processes. ... -
An Equivalence Between Sparse Approximation and Support Vector Machines
(1997-05-01)In the first part of this paper we show a similarity between the principle of Structural Risk Minimization Principle (SRM) (Vapnik, 1982) and the idea of Sparse Approximation, as defined in (Chen, Donoho and Saunders, ... -
Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
(2003-05)We solve an open problem posed by Eppstein in 1995 and re-enforced by Grohe concerning locally bounded treewidth in minor-closed families of graphs. A graph has bounded local treewidth if the subgraph induced by vertices ... -
The Equivalence of R. E. Programs and Data Flow Schemes
(1979-01)The Expressibe power of the data flow schemes of Dennis is evaluated. It is shown that data flow schemes have the power to express an arbitrary determinate functional. The proof involves a demonstration that "restricted ... -
Equivalence Problems for Monadic Schemas
(1975-06)A class of monadic program schemas is defined. This class, called iteration schemas, consists of schemas whose programs comprise assignment statements, conditional statements, and iteration statements. These schemas are ... -
Equivalence Problems in a Model of Computation
(1967-08-01)A central problem in the mathematical teory of computers and computation is to find a suitable framework for expressing the ececution of a computer program by a computer. Within the framework we want to be alble to provide ... -
Error Detection and Recovery for Robot Motion Planning with Uncertainty
(1987-07-01)Robots must plan and execute tasks in the presence of uncertainty. Uncertainty arises from sensing errors, control errors, and uncertainty in the geometry of the environment. The last, which is called model error, has ... -
Error weighted classifier combination for multi-modal human identification
(2005-12-14)In this paper we describe a technique of classifier combination used in a human identification system. The system integrates all available features from multi-modal sources within a Bayesian framework. The framework allows ... -
Essays in Algebraic Simplification
(1972-04)This thesis consists of essays on several aspects of the problem of algebraic simplification by computer. Since simplification is at the core of most algebraic manipulations, efficient and effective simplification procedures ... -
The Essential Dynamics Algorithm: Essential Results
(2003-05-01)This paper presents a novel algorithm for learning in a class of stochastic Markov decision processes (MDPs) with continuous state and action spaces that trades speed for accuracy. A transform of the stochastic MDP ... -
Estimateing a Probability using Finite Memory
(1983-11) -
Estimating Dependency Structure as a Hidden Variable
(1998-09-01)This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning ...
