Sciweavers

262 search results - page 22 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
JCO
2007
128views more  JCO 2007»
14 years 9 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
ICIP
2008
IEEE
15 years 4 months ago
Augmented tree partitioning for interactive image segmentation
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
Yangqing Jia, Jingdong Wang, Changshui Zhang, Xian...
HPCC
2007
Springer
15 years 3 months ago
An Adaptive Parallel Hierarchical Clustering Algorithm
Clustering of data has numerous applications and has been studied extensively. It is very important in Bioinformatics and data mining. Though many parallel algorithms have been des...
Zhaopeng Li, Kenli Li, Degui Xiao, Lei Yang
PATMOS
2004
Springer
15 years 3 months ago
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
IPCO
2010
184views Optimization» more  IPCO 2010»
14 years 11 months ago
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
Takuro Fukunaga