616 search results - page 39 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
ECSQARU
2003
Springer
14 years 29 days ago
2003
Springer
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
ISCAS
2002
IEEE
14 years 20 days ago
2002
IEEE
Wireless multicast/broadcast sessions, unlike wired networks, inherently reaches several nodes with a single transmission. For omnidirectional wireless broadcast to a node, all no...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
SODA
1994
ACM
13 years 9 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...