347 search results - page 18 / 70 » The Berlekamp-Massey Algorithm revisited |
96
Voted
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
CP
2006
Springer
15 years 2 months ago
2006
Springer
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
88
Voted
VLDB
1995
ACM
15 years 2 months ago
1995
ACM
Object-oriented and object-relational databases(OODB) need to be able to load the vast quantities of data that OODB users bring to them. Loading OODB datais significantly more com...
101
click to vote
ASIACRYPT
2008
Springer
15 years 26 days ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
71
Voted
ICFCA
2009
Springer
15 years 5 months ago
2009
Springer
This paper revisits the lattice-based thesaurus models which Margaret Masterman used for machine translation in the 1950’s and 60’s. Masterman’s notions are mapped onto moder...