Sciweavers

672 search results - page 114 / 135
» Lower-stretch spanning trees
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
ICDM
2006
IEEE
110views Data Mining» more  ICDM 2006»
14 years 1 months ago
Manifold Clustering of Shapes
Shape clustering can significantly facilitate the automatic labeling of objects present in image collections. For example, it could outline the existing groups of pathological ce...
Dragomir Yankov, Eamonn J. Keogh
ICRA
2006
IEEE
139views Robotics» more  ICRA 2006»
14 years 1 months ago
Adaptive Geometric Templates for Feature Matching
Robust motion recovery in tracking multiple targets using image features is affected by difficulties in obtaining good correspondences over long sequences. Difficulties are intr...
Harini Veeraraghavan, Paul R. Schrater, Nikolaos P...
CCGRID
2005
IEEE
14 years 1 months ago
Logistical multicast for data distribution
This paper describes a simple scheduling procedure for use in multicast data distribution within a logistical networking infrastructure. The goal of our scheduler is to generate a...
Jason Zurawski, D. Martin Swany, Micah Beck, Ying ...
ICPP
2005
IEEE
14 years 1 months ago
Connected k-Hop Clustering in Ad Hoc Networks
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
Shuhui Yang, Jie Wu, Jiannong Cao