Sciweavers

2137 search results - page 145 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
PAMI
1998
88views more  PAMI 1998»
14 years 9 months ago
Large-Scale Parallel Data Clustering
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
Dan Judd, Philip K. McKinley, Anil K. Jain
ICMCS
2007
IEEE
107views Multimedia» more  ICMCS 2007»
15 years 4 months ago
Finding Image Structure by Hierarchal Segmentation
Image segmentation has been studied for many years. But what factors influence segmentation results indeed? Why some images are easy to be handled while the others are not? In thi...
Bo Qiu, Daniel Racoceanu
PPAM
2007
Springer
15 years 4 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
92
Voted
JMLR
2010
118views more  JMLR 2010»
14 years 5 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
ICPR
2006
IEEE
15 years 11 months ago
Multiple Objects Tracking with Multiple Hypotheses Graph Representation
We present a novel multi-object tracking algorithm based on multiple hypotheses about the trajectories of the objects. Our work is inspired by Reid's multiple hypothesis trac...
Alex Yong Sang Chia, Liyuan Li, Weimin Huang