Sciweavers

2219 search results - page 49 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ECCV
2008
Springer
14 years 11 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal
CVPR
2009
IEEE
15 years 4 months ago
Unsupervised Learning for Graph Matching
Graph matching is an important problem in computer vision. It is used in 2D and 3D object matching and recognition. Despite its importance, there is little literature on learnin...
Marius Leordeanu, Martial Hebert
ICALP
2009
Springer
14 years 9 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson
ACCV
2007
Springer
14 years 3 months ago
Task Scheduling in Large Camera Networks
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
Ser-Nam Lim, Larry S. Davis, Anurag Mittal
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 9 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer