All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 182

Showing per page

Recognition of atherosclerotic plaques and their extended dimensioning with computerized tomography angiography imaging

Tomasz Markiewicz, Mirosław Dziekiewicz, Marek Maruszyński, Romana Bogusławska-Walecka, Wojciech Kozłowski (2014)

International Journal of Applied Mathematics and Computer Science

In this paper the authors raise the issue of automatic discrimination of atherosclerotic plaques within an artery lumen based on numerical and statistical thresholding of Computerized Tomography Angiographic (CTA) images and their advanced dimensioning as a support for preoperative vessel assessment. For the study, a set of tomograms of the aorta, as well as the ilio-femoral and femoral arteries were examined. In each case a sequence of about 130-480 images of the artery cutoff planes were analyzed...

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Edith Hemaspaandra, Jörg Rothe, Holger Spakowski (2006)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r , where r is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to NP . To achieve these main results, we also show that the restriction of the vertex cover problem to those graphs for which...

Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Edith Hemaspaandra, Jörg Rothe, Holger Spakowski (2010)

RAIRO - Theoretical Informatics and Applications

For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where r is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to NP. To achieve these main results, we also show that the restriction of the vertex cover problem to those...

Reconstructibility of Boolean control networks with time delays in states

Ping Sun, Lijun Zhang, Kuize Zhang (2018)

Kybernetika

This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current...

Reconstructing a neural net from its output.

Charles Fefferman (1994)

Revista Matemática Iberoamericana

Neural nets were originally introduced as highly simplified systems of the neural system. Today they are widely used in technology and studied theoretically by scientists from several disciplines. (See e.g. [N]). However they remain little understood. (...)

Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision

Jeremy Yirmeyahu Kaminski, Michael Fryers, Mina Teicher (2005)

Journal of the European Mathematical Society

We study some geometric configurations related to projections of an irreducible algebraic curve embedded in ℂ ℙ 3 onto embedded projective planes. These configurations are motivated by applications to static and dynamic computational vision. More precisely, we study how an irreducible closed algebraic curve X embedded in ℂ ℙ 3 , of degree d and genus g , can be recovered using its projections from points onto embedded projective planes. The embeddings are unknown. The only input is the defining equation of...

Recursive coalgebras of finitary functors

Jiří Adámek, Dominik Lücke, Stefan Milius (2007)

RAIRO - Theoretical Informatics and Applications

For finitary set functors preserving inverse images, recursive coalgebras A of Paul Taylor are proved to be precisely those for which the system described by A always halts in finitely many steps.

Currently displaying 41 – 60 of 182