2219 search results - page 235 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
146
Voted
CVPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
107
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
118
click to vote
INFOCOM
1991
IEEE
15 years 7 months ago
1991
IEEE
We have designed and implemented three multicast path finding algorithms for networks with directed links: an optimal algorithm based on the dynamic programming technique, a heuri...
256
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
140
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...