Sciweavers

79 search results - page 3 / 16
» Fast Self-Stabilizing Minimum Spanning Tree Construction
Sort
View
IPCV
2008
13 years 11 months ago
Hierarchical Minimum Spanning Trees for Lossy Image Set Compression
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
Anthony Schmieder, Howard Cheng, Barry Gergel, Xia...
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
14 years 1 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 9 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich
GREC
2003
Springer
14 years 3 months ago
Recognition of On-line Handwritten Mathematical Expressions Using a Minimum Spanning Tree Construction and Symbol Dominance
We present a structural analysis method for the recognition of on-line handwritten mathematical expressions based on a minimum spanning tree construction and symbol dominance. The ...
Ernesto Tapia, Raúl Rojas