1986 search results - page 17 / 398 » Path Separability of Graphs |
150
Voted
MICCAI
2008
Springer
16 years 7 months ago
2008
Springer
159
Voted
ICPR
2008
IEEE
16 years 24 days ago
2008
IEEE
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...
155
click to vote
SPAA
1992
ACM
15 years 10 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
132
Voted
COCOON
2001
Springer
15 years 11 months ago
2001
Springer
