Sciweavers

616 search results - page 41 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
STACS
2001
Springer
14 years 4 days ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
MOBIHOC
2002
ACM
14 years 7 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
CVPR
2006
IEEE
14 years 9 months ago
Automatic Kinematic Chain Building from Feature Trajectories of Articulated Objects
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
Jingyu Yan, Marc Pollefeys
BIOCOMP
2006
13 years 9 months ago
A Multi-strategy Approach to Protein Structural Alphabet Design
- The search for structural similarity among proteins can provide valuable insights into their functional mechanisms and their functional relationships. Though the protein 1D seque...
Shih-Yen Ku, Yuh-Jyh Hu
PCI
2005
Springer
14 years 1 months ago
Source-Based Minimum Cost Multicasting: Intermediate-Node Selection with Potentially Low Cost
Abstract. In this paper, we propose a novel heuristic algorithm for constructing a minimum cost multicast tree. Our work is based on a directed asymmetric network and shows an impr...
Gunu Jho, Moonseong Kim, Hyunseung Choo