Sciweavers

2219 search results - page 84 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
WWW
2009
ACM
14 years 11 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
CVPR
2004
IEEE
15 years 7 days ago
Multigrid and Multi-Level Swendsen-Wang Cuts for Hierarchic Graph Partition
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
Adrian Barbu, Song Chun Zhu
EUROPAR
2007
Springer
14 years 4 months ago
A Scheduling Toolkit for Multiprocessor-Task Programming with Dependencies
The performance of many scientific applications for distributed memory platforms can be increased by utilizing multiprocessor-task programming. To obtain the minimum parallel runt...
Jörg Dümmler, Raphael Kunis, Gudula R&uu...
ICML
2008
IEEE
14 years 11 months ago
Space-indexed dynamic programming: learning to follow trajectories
We consider the task of learning to accurately follow a trajectory in a vehicle such as a car or helicopter. A number of dynamic programming algorithms such as Differential Dynami...
J. Zico Kolter, Adam Coates, Andrew Y. Ng, Yi Gu, ...
PEPM
2004
ACM
14 years 3 months ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal