Sciweavers

731 search results - page 122 / 147
» Reductions to Graph Isomorphism
Sort
View
MST
2007
154views more  MST 2007»
15 years 23 days ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
PR
2007
88views more  PR 2007»
15 years 23 days ago
Robust kernel Isomap
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
Heeyoul Choi, Seungjin Choi
MICCAI
2010
Springer
14 years 11 months ago
Joint Registration and Segmentation of Dynamic Cardiac Perfusion Images Using MRFs
In this paper we propose a Markov random field (MRF) based method for joint registration and segmentation of cardiac perfusion images, specifically the left ventricle (LV). MRFs ...
Dwarikanath Mahapatra, Ying Sun
3DOR
2009
14 years 11 months ago
SkelTre - Fast Skeletonisation for Imperfect Point Cloud Data of Botanic Trees
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a...
Alexander Bucksch, Roderik C. Lindenbergh, Massimo...
ICDAR
2009
IEEE
14 years 11 months ago
Learning Bayesian Networks by Evolution for Classifier Combination
Combining classifier methods have shown their effectiveness in a number of applications. Nonetheless, using simultaneously multiple classifiers may result in some cases in a reduc...
Claudio De Stefano, Francesco Fontanella, Alessand...