Sciweavers

153 search results - page 8 / 31
» Uniformity Testing Using Minimal Spanning Tree
Sort
View
IJCM
2002
92views more  IJCM 2002»
14 years 11 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
15 years 5 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
ICIP
2007
IEEE
16 years 1 months ago
Perceptual Image Coding Based on a Maximum of Minimal Structural Similarity Criterion
Perceptual image coding algorithms typically impose perceptual modeling in a preprocessing stage. A perceptual normalization model is often used to transform the original image si...
Zhou Wang, Qiang Li, Xinli Shang
ICIP
2004
IEEE
16 years 1 months ago
Fast alignment of digital images using a lower bound on an entropy metric
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
Mert R. Sabuncu, Peter J. Ramadge
BMCBI
2010
178views more  BMCBI 2010»
14 years 11 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...