Sciweavers

SPIRE
2001
Springer
14 years 2 months ago
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...
SEQLEARN
2001
Springer
221views Algorithms» more  SEQLEARN 2001»
14 years 2 months ago
On the Need for a Neural Abstract Machine
eed for a Neural Abstract Machine Diego Sona, Alessandro Sperduti Dipartimento di Informatica Universit`a di Pisa
Diego Sona, Alessandro Sperduti
SEQLEARN
2001
Springer
216views Algorithms» more  SEQLEARN 2001»
14 years 2 months ago
Time in Connectionist Models
Jean-Cédric Chappelier, Marco Gori, Alain G...
SEQLEARN
2001
Springer
251views Algorithms» more  SEQLEARN 2001»
14 years 2 months ago
Bidirectional Dynamics for Protein Secondary Structure Prediction
Pierre Baldi, Søren Brunak, Paolo Frasconi,...
ISSAC
2001
Springer
119views Mathematics» more  ISSAC 2001»
14 years 2 months ago
Algorithms for trigonometric polynomials
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...
Jamie Mulholland, Michael B. Monagan
ISMDA
2001
Springer
14 years 2 months ago
Learning Bayesian-Network Topologies in Realistic Medical Domains
In recent years, a number of algorithms have been developed for learning the structure of Bayesian networks from data. In this paper we apply some of these algorithms to a realist...
Xiaofeng Wu, Peter J. F. Lucas, Susan Kerr, Roelf ...