2498 search results - page 131 / 500 » Algorithms for the Topological Watershed |
172
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
162
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
It is often reported in the technique literature that the success of the self-organizing feature map (SOM) formation is critically dependent on the initial weights and the selectio...
169
click to vote
ICCAD
1998
IEEE
15 years 10 months ago
1998
IEEE
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
160
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
173
click to vote
PRL
1998
15 years 5 months ago
1998
Thinning is a frequently used method for extracting skeletons in discrete spaces. This paper presents an efficient parallel Žthinning algorithm that directly extracts medial line...