1986 search results - page 17 / 398 » Path Separability of Graphs |
127
click to vote
ICPR
2008
IEEE
15 years 9 months 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...
117
Voted
SPAA
1992
ACM
15 years 7 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...
COCOON
2001
Springer
15 years 7 months ago
2001
Springer
114
Voted
SWAT
2000
Springer
15 years 6 months ago
2000
Springer
