Sciweavers

1160 search results - page 5 / 232
» Revisiting the Sequence Constraint
Sort
View
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
14 years 10 months ago
The Berlekamp-Massey Algorithm revisited
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...
Nadia Ben Atti, Gema M. Diaz-Toca, Henri Lombardi
82
Voted
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 2 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
81
Voted
TPLP
2008
89views more  TPLP 2008»
14 years 10 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
76
Voted
PKDD
2005
Springer
105views Data Mining» more  PKDD 2005»
15 years 3 months ago
Protein Sequence Pattern Mining with Constraints
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences...
Pedro Gabriel Ferreira, Paulo J. Azevedo
98
Voted
TPDS
2008
111views more  TPDS 2008»
14 years 10 months ago
Comments on "Optimal Resource Allocation in Overlay Multicast"
In this comments paper, we revisit the network model introduced in [1]. We discuss the inaccuracy of the model and, to correct the network model, we propose to apply directed capac...
Jinyao Yan, Martin May, Bernhard Plattner