2463 search results - page 342 / 493 » Rankings of Directed Graphs |
JSSPP
2010
Springer
13 years 7 months ago
2010
Springer
Many computational solutions can be expressed as directed acyclic graphs (DAGs) with weighted nodes. In parallel computing, scheduling such DAGs onto manycore processors remains a ...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
Analyzing videos of human activities involves not only
recognizing actions (typically based on their appearances),
but also determining the story/plot of the video. The storyline...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
Numerous applications processing 3D point data will gain from the ability to estimate reliably normals and differential geometric properties. Normal estimates are notoriously nois...