Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions

Now showing items 1041-1060 of 2625

  • Component based recognition of objects in an office environment 

    Unknown author (2003-11-28)
    We present a component-based approach for recognizing objectsunder large pose changes. From a set of training images of a givenobject we extract a large number of components which are clusteredbased on the similarity of ...

  • Finding Longest Increasing and Common Subsequences in Streaming Data 

    Unknown author (2003-11-26)
    In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence(LIS) and Longest Common Subsequence (LCS) problems in the data streaming model.

  • The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 

    Unknown author (2003-11-20)
    We prove that a random 3-SAT instance with clause-to-variable densityless than 3.52 is satisfiable with high probability.The proof comes through an algorithm which selects (and sets) a variabledepending on its degree and ...

  • Efficient Specification-Assisted Error Localization and Correction 

    Unknown author (2003-11-13)
    We present a new error localization tool, Archie, that accepts aspecification of key data structure consistency constraints, then generatesan algorithm that checks if the data structures satisfy theconstraints. We also ...

  • Scalable Internet Routing on Topology-Independent Node Identities 

    Unknown author (2003-10-31)
    Unmanaged Internet Protocol (UIP) is a fully selforganizingnetwork-layer protocol that implements scalableidentity-based routing. In contrast with addressbasedrouting protocols, which depend for scalability oncentralized ...

  • Evolving Robocode Tank Fighters 

    Unknown author (2003-10-28)
    In this paper, I describe the application of genetic programming to evolve a controller for a robotic tank in a simulated environment.The purpose is to explore how genetic techniques can best be applied to produce controllers ...

  • On Role Logic 

    Unknown author (2003-10-24)
    We present role logic, a notation for describing propertiesof relational structures in shape analysis, databases, andknowledge bases. We construct role logic using the ideas ofde Bruijn's notation for lambda calculus, an ...

  • A Stream Algorithm for the SVD 

    Unknown author (2003-10-22)
    We present a stream algorithm for the Singular-Value Decomposition (SVD) of anM X N matrix A. Our algorithm trades speed of numerical convergence for parallelism,and derives from a one-sided, cyclic-by-rows Hestenes SVD. ...

  • Updatable Zero-Knowledge Sets 

    Unknown author (2003-10-14)
    We build on the work of Micali, Rabin, and Killian [4] to introduce zero-knowledge sets and databases that may be updated in a desirable way. In particular, in order to make an update the owner of the set must publish a ...

  • A Correctness Proof for a Byzantine-Fault-Tolerant Read/Write Atomic Memory with Dynamic Replica Membership 

    Unknown author (2003-09-25)
    We prove correctness of a Byzantine-fault-tolerant replication algorithm for a read/writeatomic memory that supports a dynamic replica set.

  • Investigating shape representation in area V4 with HMAX: Orientation and Grating selectivities 

    Unknown author (2003-09-08)
    The question of how shape is represented is of central interest to understanding visual processing in cortex. While tuning properties of the cells in early part of the ventral visual stream, thought to be responsible for ...

  • Exploiting Vector Parallelism in Software Pipelined Loops 

    Unknown author (2005-06-03)
    An emerging trend in processor design is the incorporation of short vector instructions into the ISA. In fact, vector extensions have appeared in most general-purpose microprocessors. To utilize these instructions, ...

  • Dynamic Input/Output Automata: A Formal Model for Dynamic Systems 

    Unknown author (2003-07-26)
    We present a mathematical state-machine model, the Dynamic I/O Automaton (DIOA) model, for defining and analyzing dynamic systems of interacting components. The systems we consider are dynamic in two senses: (1) components ...

  • On Our Experience with Modular Pluggable Analyses 

    Unknown author (2004-10-04)
    We present a technique that enables the focused applicationof multiple analyses to di erent modules in thesame program. In our approach, each module encapsulatesone or more data structures and uses membershipin abstract ...

  • Pyramid Match Kernels: Discriminative Classification with Sets of Image Features 

    Unknown author (2005-03-17)
    Discriminative learning is challenging when examples are setsof local image features, and the sets vary in cardinality and lackany sort of meaningful ordering. Kernel-based classificationmethods can learn complex decision ...

  • Systematic Conformational Search with Constraint Satisfaction 

    Unknown author (2004-10-01)
    Throughout biological, chemical, and pharmaceutical research,conformational searches are used to explore the possiblethree-dimensional configurations of molecules. This thesis describesa new systematic method for ...

  • Automatic Software Upgrades for Distributed Systems (PhD thesis) 

    Unknown author (2005-10-06)
    Upgrading the software of long-lived, highly-available distributedsystems is difficult. It is not possible to upgrade all the nodes in asystem at once, since some nodes may be unavailable and halting thesystem for an ...

  • Selectivity of Local Field Potentials in Macaque Inferior Temporal Cortex 

    Unknown author (2004-09-21)
    While single neurons in inferior temporal (IT) cortex show differential responses to distinct complex stimuli, little is known about the responses of populations of neurons in IT. We recorded single electrode data, including ...

  • The Interval Programming Model for Multi-objective Decision Making 

    Unknown author (2004-09-27)
    The interval programming model (IvP) is a mathematical programmingmodel for representing and solving multi-objective optimizationproblems. The central characteristic of the model is the use ofpiecewise linearly defined ...

  • The Quorum Deployment Problem 

    Unknown author (2004-10-29)
    Quorum systems are commonly used to maintain the consistency of replicated data in adistributed system. Much research has been devoted to developing quorum systems with good theoreticalproperties, such as fault tolerance ...