Sciweavers

2219 search results - page 59 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
14 years 4 months ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar
CVPR
2005
IEEE
15 years 5 days ago
Spectral Segmentation with Multiscale Graph Decomposition
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
Florence Bénézit, Jianbo Shi, Timoth...
DAC
1999
ACM
14 years 11 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
EMMCVPR
2001
Springer
14 years 2 months ago
Averaged Template Matching Equations
By exploiting an analogy with averaging procedures in fluid dynamics, we present a set of averaged template matching equations. These equations are analogs of the exact template m...
Anil N. Hirani, Jerrold E. Marsden, James Arvo
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 10 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...