Sciweavers

19320 search results - page 248 / 3864
» On the complexity of computing determinants
Sort
View
IWINAC
2007
Springer
16 years 23 days ago
Morphisms of ANN and the Computation of Least Fixed Points of Semantic Operators
We consider a notion of morphism of neural networks and develop its properties. We show how, given any definite logic program P, the least fixed point of the immediate consequenc...
Anthony Karel Seda
MVA
1992
128views Computer Vision» more  MVA 1992»
15 years 7 months ago
Computation of Surface Curvature from Range Images Using Geometrically Intrinsic Weights
This paper presents a method to compute Mean and Gaussian curvatures from range images. The first and second partial derivatives are estimated by the weighted least squares fit of...
Takio Kurita, Pierre Boulanger
BMCBI
2006
121views more  BMCBI 2006»
15 years 6 months ago
Robust computational reconstitution - a new method for the comparative analysis of gene expression in tissues and isolated cell
Background: Biological tissues consist of various cell types that differentially contribute to physiological and pathophysiological processes. Determining and analyzing cell type-...
Martin Hoffmann, Dirk Pohlers, Dirk Koczan, Hans-J...
JSC
2011
110views more  JSC 2011»
15 years 1 months ago
Computing symmetric rank for symmetric tensors
We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for...
Alessandra Bernardi, Alessandro Gimigliano, Monica...
ITA
2006
15 years 6 months ago
Complexity classes for membrane systems
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...