Search
Now showing items 41-50 of 56
A Robust Amorphous Hierarchy from Persistent Nodes
(2003-05-01)
For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a hierarchy, but hierarchies ...
Light Field Morphable Models
(2003-04-18)
Statistical shape and texture appearance models are powerful image representations, but previously had been restricted to 2D or simple 3D shapes. In this paper we present a novel 3D morphable model based on image-based ...
Learning object segmentation from video data
(2003-09-08)
This memo describes the initial results of a project to create a self-supervised algorithm for learning object segmentation from video data. Developmental psychology and computational experience have demonstrated that the ...
Fast Contour Matching Using Approximate Earth Mover's Distance
(2003-12-05)
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost of matching features from one shape to the features ...
Permutation Tests for Classification
(2003-08-28)
We introduce and explore an approach to estimating statistical significance of classification accuracy, which is particularly useful in scientific applications of machine learning where high dimensionality of the data and ...
RamboNodes for the Metropolitan Ad Hoc Network
(2003-12-17)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away ...
Mobilized ad-hoc networks: A reinforcement learning approach
(2003-12-04)
Research in mobile ad-hoc networks has focused on situations in which nodes have no control over their movements. We investigate an important but overlooked domain in which nodes do have control over their movements. ...
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 ...
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 ...