Sciweavers

2436 search results - page 24 / 488
» Comonadic Notions of Computation
Sort
View
AAECC
2006
Springer
135views Algorithms» more  AAECC 2006»
13 years 7 months ago
Computing Hypergeometric Solutions of Linear Recurrence Equations
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
Thomas Cluzeau, Mark van Hoeij
IWINAC
2007
Springer
14 years 1 months 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
ALMOB
2008
131views more  ALMOB 2008»
13 years 7 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
APAL
2006
91views more  APAL 2006»
13 years 7 months ago
Computing interpolants in implicational logics
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
Makoto Kanazawa
JAT
2006
82views more  JAT 2006»
13 years 7 months ago
Construction of recurrent bivariate fractal interpolation surfaces and computation of their box-counting dimension
Recurrent bivariate fractal interpolation surfaces (RBFISs) generalise the notion of affine fractal interpolation surfaces (FISs) in that the iterated system of transformations us...
P. Bouboulis, Leoni Dalla, V. Drakopoulos