Sciweavers

1566 search results - page 10 / 314
» On a Cone Covering Problem
Sort
View
IPL
2008
135views more  IPL 2008»
13 years 7 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
WG
2007
Springer
14 years 1 months ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
Bruno Escoffier, Laurent Gourvès, Jé...
KBSE
2010
IEEE
13 years 5 months ago
Reducing estimation uncertainty with continuous assessment: tracking the "cone of uncertainty"
Accurate software cost and schedule estimations are essential especially for large software projects. However, once the required efforts have been estimated, little is done to rec...
Pongtip Aroonvatanaporn, Chatchai Sinthop, Barry W...
MICCAI
2009
Springer
14 years 8 months ago
Dynamic Cone Beam Reconstruction Using a New Level Set Formulation
Abstract. This paper addresses an approach toward tomographic reconstruction from rotational angiography data as it is generated by Carms in cardiac imaging. Since the rotational a...
Andreas Keil, Jakob Vogel, Günter Lauritsch, ...
MICCAI
2010
Springer
13 years 5 months ago
Optimized Anisotropic Rotational Invariant Diffusion Scheme on Cone-Beam CT
Cone-beam computed tomography (CBCT) is an important image modality for dental surgery planning, with high resolution images at a relative low radiation dose. In these scans the ma...
Dirk-Jan Kroon, Cornelis H. Slump, Thomas J. J. Ma...