Open Access Repositories: Recent submissions
Now showing items 2541-2560 of 4204
-
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 ...
-
Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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
(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 ...
-
Combining dynamic abstractions in large MDPs
(2004-10-21)One of the reasons that it is difficult to plan and act in real-worlddomains is that they are very large. Existing research generallydeals with the large domain size using a static representation andexploiting a single ...
-
NIRA: A New Internet Routing Architecture
(2004-10-14)The present Internet routing system faces two challengingproblems. First, unlike in the telephone system, Internet users cannotchoose their wide-area Internet service providers (ISPs) separatelyfrom their local access ...
-
Byzantine Fault Tolerance in Long-Lived Systems
(2004-08-13)This paper proposes counter-measures that can be deployedas part of a replicated system to reduce the size ofW, and thus reduce the class of attacks to which the system is vulnerable. Obviously it will not be possible to ...
-
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 ...
-
Early Sketch Processing with Application in HMM Based Sketch Recognition
(2004-07-28)Freehand sketching is a natural and crucial part of everyday humaninteraction, yet is almost totally unsupported by current user interfaces. With the increasing availability of tablet notebooks and pen based PDAs, sketchbased ...
-
Realistic Modeling of Simple and Complex Cell Tuning in the HMAXModel, and Implications for Invariant Object Recognition in Cortex
(2004-07-27)Riesenhuber \& Poggio recently proposed a model of object recognitionin cortex which, beyond integrating general beliefs about the visualsystem in a quantitative framework, made testable predictions aboutvisual processing. ...
-
Distribution Volume Tracking on Privacy-Enhanced Wireless Grid
(2004-07-25)In this paper, we discuss a wireless grid in which users are highly mobile, and form ad-hoc and sometimes short-lived connections with other devices. As they roam through networks, the users may choose to employ ...
