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

Now showing items 961-980 of 2625

  • Biologically-Inspired Robust Spatial Programming 

    Unknown author (2005-01-18)
    Inspired by the robustness and flexibility of biological systems, we are developing linguistic and programming tools to allow us to program spatial systems populated by vast numbers of unreliable components interconnected ...

  • How Much of a Hypertree can be Captured by Windmills? 

    Unknown author (2005-01-03)
    Current approximation algorithms for maximum weight {\em hypertrees} find heavy {\em windmill farms}, and are based on the fact that a constant ratio (for constant width $k$) of the weight of a $k$-hypertree can be captured ...

  • A Dynamic Data Structure for Checking Hyperacyclicity 

    Unknown author (2005-01-03)
    We present a dynamic data structure that keeps track of an acyclic hypergraph (equivalently, a triangulated graph) and enables verifying that adding a candidate hyperedge (clique) will not break the acyclicity of the ...

  • Neural Voting Machines 

    Unknown author (2004-12-31)
     Winner-take-all networks typically pick as winners that alternative with the largest excitatory input. This choice is far from optimal when there is uncertainty in the strength of the inputs, and when information is ...

  • A general mechanism for tuning: Gain control circuits and synapses underlie tuning of cortical neurons 

    Unknown author (2004-12-31)
    Tuning to an optimal stimulus is a widespread property of neurons in cortex. We propose that such tuning is a consequence of normalization or gain control circuits. We also present a biologically plausible neural circuitry ...

  • Methods and Experiments With Bounded Tree-width Markov Networks 

    Unknown author (2004-12-30)
    Markov trees generalize naturally to bounded tree-width Markov networks, onwhich exact computations can still be done efficiently. However, learning themaximum likelihood Markov network with tree-width greater than 1 is ...

  • Machine-Checkable Correctness Proofs forIntra-procedural Dataflow Analyses 

    Unknown author (2004-12-16)
    This technical report describes our experience using the interactive theorem proverAthena for proving the correctness of abstract interpretation-based dataflow analyses.For each analysis, our methodology requires the ...

  • On Decision Procedures for Set-Value Fields 

    Unknown author (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 ...

  • Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem 

    Unknown author (2004-11-24)
    Given a graph G = (V,E) and k source-sink pairs of vertices, this papers investigates the maximum rate r at which all pairs can simultaneously communicate. We view this problem from two perspectives and compare their ...

  • Learning with Matrix Factorizations 

    Unknown author (2004-11-22)
    Matrices that can be factored into a product of two simpler matricescan serve as a useful and often natural model in the analysis oftabulated or high-dimensional data. Models based on matrixfactorization (Factor Analysis, ...

  • Availability-Consistency Trade-Offs in a Fault-Tolerant Stream Processing System 

    Unknown author (2004-11-22)
    processing. In contrast to previous techniques that handlenode failures, our approach also tolerates network failuresand network partitions. The approach is based on a principledtrade-off between consistency and availability ...

  • Efficient Image Matching with Distributions of Local Invariant Features 

    Unknown author (2004-11-22)
    Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature sets' similarity via a voting scheme (which ...

  • A new biologically motivated framework for robust object recognition 

    Unknown author (2004-11-14)
    In this paper, we introduce a novel set of features for robust object recognition, which exhibits outstanding performances on a variety ofobject categories while being capable of learning from only a fewtraining examples. ...

  • Capacity Allocation in Wireless LANs 

    Unknown author (2004-11-12)
    Today's access point based wireless LANs (WLANs) are inefficient and unfair. For many traffic loads they provide far less total throughput than they should, and do a poor job allocating what throughput they do deliver. ...

  • Regularization Through Feature Knock Out 

    Unknown author (2004-11-12)
    In this paper, we present and analyze a novel regularization technique based on enhancing our dataset with corrupted copies of the original data. The motivation is that since the learning algorithm lacks information about ...

  • Shape Representation in V4: Investigating Position-Specific Tuning for Boundary Conformation with the Standard Model of Object Recognition 

    Unknown author (2004-11-12)
    The computational processes in the intermediate stages of the ventral pathway responsible for visual object recognition are not well understood. A recent physiological study by A. Pasupathy and C. Connor in intermediate ...

  • Neural Network Models for Zebra Finch Song Production and Reinforcement Learning 

    Unknown author (2004-11-09)
    The zebra finch is a standard experimental system for studying learning and generation of temporally extended motor patterns. The first part of this project concerned the evaluation of simple models for the operation and ...

  • Managing the 802.11 Energy/Performance Tradeoff with Machine Learning 

    Unknown author (2004-10-27)
    This paper addresses the problem of managing the tradeoff betweenenergy consumption and performance in wireless devices implementingthe IEEE 802.11 standard. To save energy, the 802.11 specificationproposes a power-saving ...

  • On Spatial Conjunction as Second-Order Logic 

    Unknown author (2004-10-25)
    Spatial conjunction is a powerful construct for reasoning about dynamically allocateddata structures, as well as concurrent, distributed and mobile computation. Whileresearchers have identified many uses of spatial ...

  • Botz-4-Sale: Surviving Organized DDoS Attacks that Mimic Flash Crowds 

    Unknown author (2004-10-22)
    Recent denial of service attacks are mounted by professionalsusing Botnets of tens of thousands of compromisedmachines. To circumvent detection, attackers areincreasingly moving away from pure bandwidth oods toattacks ...