4926 search results - page 359 / 986 » Two Graph Algorithms On an Associative Computing Model |
183
click to vote
CVPR
2012
IEEE
13 years 7 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
174
click to vote
CVGIP
2004
15 years 4 months ago
2004
This paper presents a surface reconstruction algorithm that can recover correct shape geometry as well as its unknown topology from both volumetric images and unorganized point cl...
133
click to vote
ICPR
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper we survey two multi-dimensional Scale Saliency approaches based on graphs and the k-d partition algorithm. In the latter case we introduce a new divergence metric an...
149
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
119
click to vote
JSSPP
2009
Springer
15 years 11 months ago
2009
Springer
Scheduling a task graph onto several processors is a trade-off between maximising concurrency and minimising interprocessor communication. A technique to reduce or avoid interproc...