Sciweavers

616 search results - page 32 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
ICCAD
2006
IEEE
132views Hardware» more  ICCAD 2006»
14 years 2 months ago
Clock buffer polarity assignment for power noise reduction
Abstract—Power/ground noise is a major source of VLSI circuit timing variations. This work aims to reduce clock network induced power noise by assigning different signal polariti...
Rupak Samanta, Ganesh Venkataraman, Jiang Hu
JUCS
2007
108views more  JUCS 2007»
13 years 8 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
COCOON
1999
Springer
14 years 1 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 6 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
CVPR
2008
IEEE
14 years 3 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...