Search
Now showing items 401-410 of 648
Near-Optimal Distributed Failure Circumscription
(2003-08-11)
Small failures should only disrupt a small part of a network. One way to do this is by marking the surrounding area as untrustworthy --- circumscribing the failure. This can be done with a distributed algorithm using ...
Evolving Robocode Tank Fighters
(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 ...
How People Re-find Information When the Web Changes
(2004-06-18)
This paper investigates how people return to information in a dynamic information environment. For example, a person might want to return to Web content via a link encountered earlier on a Web page, only to learn that the ...
A Unified Statistical and Information Theoretic Framework for Multi-modal Image Registration
(2004-04-28)
We formulate and interpret several multi-modal registration methods in the context of a unified statistical and information theoretic framework. A unified interpretation clarifies the implicit assumptions of each method ...
Contextual models for object detection using boosted random fields
(2004-06-25)
We seek to both detect and segment objects in images. To exploit both local image data as well as contextual information, we introduce Boosted Random Fields (BRFs), which uses Boosting to learn the graph structure and local ...
Contextual Influences on Saliency
(2004-04-14)
This article describes a model for including scene/context priors in attention guidance. In the proposed scheme, visual context information can be available early in the visual processing chain, in order to modulate the ...
A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
(2004-07-05)
We present a constant-factor approximation algorithm for computing an embedding of the shortest path metric of an unweighted graph into a tree, that minimizes the multiplicative distortion.
Optimal Approximations of the Frequency Moments
(2004-07-02)
We give a one-pass, O~(m^{1-2/k})-space algorithm for estimating the k-th frequency moment of a data stream for any real k>2. Together with known lower bounds, this resolves the main problem left open by Alon, Matias, ...
Using Analogy to Acquire Commonsense Knowledge from Human Contributors
(2003-02-12)
The goal of the work reported here is to capture the commonsense knowledge of non-expert human contributors. Achieving this goal will enable more intelligent human-computer interfaces and pave the way for computers to ...
ADAM: A Decentralized Parallel Computer Architecture Featuring Fast Thread and Data Migration and a Uniform Hardware Abstraction
(2002-06-01)
The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the ...