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

Now showing items 921-940 of 2625

  • Ultra-fast Object Recognition from Few Spikes 

    Unknown author (2005-07-06)
    Understanding the complex brain computations leading to object recognition requires quantitatively characterizing the information represented in inferior temporal cortex (IT), the highest stage of the primate visual stream. ...

  • Etna: a Fault-tolerant Algorithm for Atomic Mutable DHT Data 

    Unknown author (2005-06-15)
    This paper presents Etna, an algorithm for atomic reads and writes of replicated data stored in a distributed hash table. Etna correctly handles dynamically changing sets of replica hosts, and is optimized for reads, writes, ...

  • Autonomous Virtual Mobile Nodes 

    Unknown author (2005-06-15)
    This paper presents a new abstraction for virtual infrastructure in mobile ad hoc networks. An AutonomousVirtual Mobile Node (AVMN) is a robust and reliable entity that is designed to cope with theinherent difficulties ...

  • Automatic Test Factoring for Java 

    Unknown author (2005-06-08)
    Test factoring creates fast, focused unit tests from slow system-widetests; each new unit test exercises only a subset of the functionalityexercised by the system test. Augmenting a test suite with factoredunit tests ...

  • Nonlinear Latent Variable Models for Video Sequences 

    Unknown author (2005-06-06)
    Many high-dimensional time-varying signals can be modeled as a sequence of noisy nonlinear observations of a low-dimensional dynamical process. Given high-dimensional observations and a distribution describing the ...

  • Theoretical Analysis of Geographic Routing in Social Networks 

    Unknown author (2005-06-03)
    We introduce a formal model for geographic social networks, and introduce the notion of rank-based friendship, in which the probability that a person v is a friend of a person u is inversely proportional to the number of ...

  • A Novel Active Contour Framework. Multi-component Level Set Evolution under Topology Control 

    Unknown author (2005-06-01)
    We present a novel framework to exert a topology control over a level set evolution. Level set methods offer several advantages over parametric active contours, in particular automated topological changes. In some applications, ...

  • Simultaneous Localization and Tracking in Wireless Ad-hoc Sensor Networks 

    Unknown author (2005-05-31)
    In this thesis we present LaSLAT, a sensor network algorithm thatsimultaneously localizes sensors, calibrates sensing hardware, andtracks unconstrained moving targets using only range measurementsbetween the sensors and ...

  • Empirical Effective Dimension and Optimal Rates for Regularized Least Squares Algorithm 

    Unknown author (2005-05-27)
    This paper presents an approach to model selection for regularized least-squares on reproducing kernel Hilbert spaces in the semi-supervised setting. The role of effective dimension was recently shown to be crucial in the ...

  • Comparing Visual Features for Morphing Based Recognition 

    Unknown author (2005-05-25)
    This thesis presents a method of object classification using the idea of deformable shape matching. Three types of visual features, geometric blur, C1 and SIFT, are used to generate feature descriptors. These feature ...

  • Lexical Chains and Sliding Locality Windows in Content-based Text Similarity Detection 

    Unknown author (2005-05-19)
    We present a system to determine content similarity of documents. More specifically, our goal is to identify book chapters that are translations of the same original chapter; this task requires identification of not only ...

  • Some Properties of Empirical Risk Minimization over Donsker Classes 

    Unknown author (2005-05-17)
    We study properties of algorithms which minimize (or almost minimize) empirical error over a Donsker class of functions. We show that the L2-diameter of the set of almost-minimizers is converging to zero in probability. ...

  • A Region-based Architecture for Service-Providing Distributed Systems 

    Unknown author (2005-05-17)
    A service-providing system consists of hosts that provide services such as data, content, computational and memory resources and data-based services to other entities in the system. Consumers that wish to use services ...

  • Risk Bounds for Regularized Least-squares Algorithm with Operator-valued kernels 

    Unknown author (2005-05-16)
    We show that recent results in [3] on risk bounds for regularized least-squares on reproducing kernel Hilbert spaces can be straightforwardly extended to the vector-valued regression setting. We first briefly introduce ...

  • Efficient, Verifiable Binary Sandboxing for a CISC Architecture 

    Unknown author (2005-05-02)
    Executing untrusted code while preserving security requiresenforcement of memory and control-flow safety policies:untrusted code must be prevented from modifying memory orexecuting code except as explicitly allowed. ...

  • Simultaneous Localization, Calibration, and Tracking in an ad Hoc Sensor Network 

    Unknown author (2005-04-26)
    We introduce Simultaneous Localization and Tracking (SLAT), the problem of tracking a target in a sensor network while simultaneously localizing and calibrating the nodes of the network. Our proposed solution, LaSLAT, ...

  • Gestural Cues for Sentence Segmentation 

    Unknown author (2005-04-19)
    In human-human dialogues, face-to-face meetings are often preferred over phone conversations.One explanation is that non-verbal modalities such as gesture provide additionalinformation, making communication more efficient ...

  • Fast Rates for Regularized Least-squares Algorithm 

    Unknown author (2005-04-14)
    We develop a theoretical analysis of generalization performances of regularized least-squares on reproducing kernel Hilbert spaces for supervised learning. We show that the concept of effective dimension of an integral ...

  • Learning From Snapshot Examples 

    Unknown author (2005-04-13)
    Examples are a powerful tool for teaching both humans and computers.In order to learn from examples, however, a student must first extractthe examples from its stream of perception. Snapshot learning is ageneral approach ...

  • De-Emphasis of Distracting Image Regions Using Texture Power Maps 

    Unknown author (2005-04-12)
    A major obstacle in photography is the presence of distracting elements that pull attention away from the main subject and clutter the composition. In this article, we present a new image-processing technique that reduces ...