Sciweavers

196 search results - page 18 / 40
» Globally optimal bilinear programming for computer vision ap...
Sort
View
IJCAI
2003
13 years 9 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
CVPR
2004
IEEE
14 years 9 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
IPPS
2005
IEEE
14 years 1 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
CVPR
2010
IEEE
13 years 5 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
CVPR
2000
IEEE
14 years 9 months ago
Dynamic Layer Representation with Applications to Tracking
A dynamic layer representation is proposed in this paper for tracking moving objects. Previous work on layered representations has largely concentrated on two-/multiframe batch fo...
Hai Tao, Harpreet S. Sawhney, Rakesh Kumar