73 search results - page 15 / 15 » Decidability of Sub-theories of Polynomials over a Finite Fi... |
COLT
1994
Springer
13 years 9 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
ECCC
2006
13 years 5 months ago
2006
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...