183 search results - page 12 / 37 » On the Matching Problem for Special Graph Classes |
181
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
152
click to vote
SIAMJO
2008
15 years 4 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
143
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
116
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
140
click to vote
TCSV
2010
14 years 11 months ago
2010
We propose a new distance measure for face recognition and human gait recognition. Each probe image (a face image or an average human silhouette image) is represented as a set of ...