347 search results - page 16 / 70 » The Berlekamp-Massey Algorithm revisited |
95
Voted
COCOON
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
ICMLA
2008
15 years 8 days ago
2008
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
BIRTHDAY
2009
Springer
15 years 5 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
88
Voted
EUROCRYPT
2004
Springer
15 years 4 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
101
click to vote
PDIS
1993
IEEE
15 years 3 months ago
1993
IEEE
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...