895 search results - page 7 / 179 » Using graphs for some discrete tomography problems |
AAAI
1990
13 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
JSAT
2008
13 years 7 months ago
2008
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
WG
2009
Springer
14 years 1 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
ISBI
2008
IEEE
14 years 8 months ago
2008
IEEE
Reconstruction algorithms for Optical Diffuse Tomography (ODT) rely heavily on fast and accurate forward models. Arbitrary geometries and boundary conditions need to be handled ri...