347 search results - page 4 / 70 » The Berlekamp-Massey Algorithm revisited |
122
click to vote
COMGEO
2002
ACM
15 years 13 days ago
2002
ACM
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
85
Voted
STOC
2006
ACM
15 years 6 months ago
2006
ACM
We revisit the general RL vs. L question, obtaining the following results.
118
click to vote
CEC
2010
IEEE
14 years 4 months ago
2010
IEEE
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
122
click to vote
SWAT
2010
Springer
14 years 10 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
112
Voted
MST
2010
14 years 7 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...