5473 search results - page 805 / 1095 » On the graph isomorphism problem |
166
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
179
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— Computing a motion that enables a mobile manipulator to open a door is challenging because it requires tight coordination between the motions of the arm and the base. H...
204
click to vote
ICST
2010
IEEE
15 years 5 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
166
click to vote
JCT
2010
15 years 5 months ago
2010
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
182
click to vote
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
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 ...