Search
Now showing items 21-30 of 225
Virtual Visual Hulls: Example-Based 3D Shape Estimation from a Single Silhouette
(2004-01-28)
Recovering a volumetric model of a person, car, or other objectof interest from a single snapshot would be useful for many computergraphics applications. 3D model estimation in general is hard, andcurrently requires active ...
On the difficulty of feature-based attentional modulations in visual object recognition: A modeling study.
(2004-01-14)
Numerous psychophysical experiments have shown an important role for attentional modulations in vision. Behaviorally, allocation of attention can improve performance in object detection and recognition tasks. At the neural ...
Fast Contour Matching Using Approximate Earth Mover's Distance
(2003-12-05)
Weighted graph matching is a good way to align a pair of shapesrepresented by a set of descriptive local features; the set ofcorrespondences produced by the minimum cost of matching features fromone shape to the features ...
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 whichnodes have no control over their movements. We investigate animportant but overlooked domain in which nodes do have controlover their movements. ...
Risk Bounds for Mixture Density Estimation
(2004-01-27)
In this paper we focus on the problem of estimating a boundeddensity using a finite combination of densities from a givenclass. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by Li ...
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 ...
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 ...
Discovering Latent Classes in Relational Data
(2004-07-22)
We present a framework for learning abstract relational knowledge with the aimof explaining how people acquire intuitive theories of physical, biological, orsocial systems. Our approach is based on a generative relational ...
A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees
(2004-07-05)
We present a constant-factor approximation algorithm for computing anembedding of the shortest path metric of an unweighted graph into atree, that minimizes the multiplicative distortion.