2219 search results - page 86 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
FAW
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
ACSC
2010
IEEE
13 years 5 months ago
2010
IEEE
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...
CVPR
2004
IEEE
15 years 7 days ago
2004
IEEE
Can we detect low dimensional structure in high dimensional data sets of images? In this paper, we propose an algorithm for unsupervised learning of image manifolds by semidefinit...
WCFLP
2005
ACM
14 years 3 months ago
2005
ACM
Program slicing is a well-known technique that extracts from a program those statements which are relevant to a particular criterion. While static slicing does not consider any in...
EGH
2005
Springer
14 years 3 months ago
2005
Springer
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...