347 search results - page 54 / 70 » The Berlekamp-Massey Algorithm revisited |
95
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
ICRA
2006
IEEE
15 years 4 months ago
2006
IEEE
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
COMPGEOM
2004
ACM
15 years 4 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
95
Voted
CINQ
2004
Springer
15 years 4 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
89
Voted
QSIC
2003
IEEE
15 years 4 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...