347 search results - page 37 / 70 » The Berlekamp-Massey Algorithm revisited |
115
click to vote
PODS
2008
ACM
16 years 25 days ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
118
Voted
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
106
click to vote
DCC
2007
IEEE
16 years 9 days ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
121
click to vote
ESAS
2004
Springer
15 years 6 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
124
Voted
ILP
2004
Springer
15 years 6 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...