Sciweavers

616 search results - page 53 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
ASPDAC
2006
ACM
143views Hardware» more  ASPDAC 2006»
14 years 1 months ago
CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
Yiyu Shi, Tong Jing, Lei He, Zhe Feng 0002, Xianlo...
JCP
2006
98views more  JCP 2006»
13 years 7 months ago
Backward Coding of Wavelet Trees with Fine-grained Bitrate Control
Backward Coding of Wavelet Trees (BCWT) is an extremely fast wavelet-tree-based image coding algorithm. Utilizing a unique backward coding algorithm, BCWT also provides a rich set ...
Jiangling Guo, Sunanda Mitra, Brian Nutter, Tanja ...
FOCS
2002
IEEE
14 years 19 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
DIAL
2006
IEEE
167views Image Analysis» more  DIAL 2006»
14 years 1 months ago
Tree clustering for layout-based document image retrieval
We describe a system for the retrieval on the basis of layout similarity of document images belonging to collections stored in digital libraries. Layout regions are extracted and ...
Simone Marinai, Emanuele Marino, Giovanni Soda
ADHOC
2005
102views more  ADHOC 2005»
13 years 7 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...