1963 search results - page 48 / 393 » The Maximum Solution Problem on Graphs |
137
click to vote
JMLR
2010
15 years 28 days ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
122
click to vote
ARSCOM
2007
15 years 2 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
238
click to vote
IPMI
2011
Springer
14 years 6 months ago
2011
Springer
Tumor segmentation in PET and CT images is notoriously challenging due to the low spatial resolution in PET and low contrast in CT images. In this paper, we proposed a general fram...
148
click to vote
ISBI
2011
IEEE
14 years 6 months ago
2011
IEEE
We develop a new algorithm to segment the hippocampus from MR images. Our method uses a new classifier ensemble algorithm to correct segmentation errors produced by a multi-atlas...
VISUALIZATION
2002
IEEE
15 years 7 months ago
2002
IEEE
Finding the “best” viewing parameters for a scene is quite difficult but a very important problem. Fully automatic procedures seem to be impossible as the notion of “best...