Results 201 to 210 of about 23,608 (225)

Learning DNF in time

Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001
Using techniques from learning theory, we show that any s-term DNF over n variables can be computed by a polynomial threshold function of degree O(n^{1/3} \log s). This upper bound matches, up to a logarithmic factor, the longstanding lower bound given by Minsky and Papert in their 1968 book {\em Perceptrons}.
Adam R. Klivans, Rocco Servedio
openaire   +1 more source

Dynamic Network Function (DNF)

Proceedings of the Asian Internet Engineering Conference, 2018
The vertical interplay among Edge-Fog-Cloud computing introduces a new requirement to accommodate services, network functions and chains of them in a heterogeneous environment. However, such operation involves challenging tasks including management of resource availability, compliance with Service Level Agreements (SLAs), dynamic re-configuration of ...
Anish Hirwe, Mrinal Aich, Kotaro Kataoka
openaire   +1 more source

Learning nearly monotone k-term DNF

Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Castro, Jorge   +2 more
openaire   +2 more sources

Horn functions and their DNFs

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hammer, Peter L., Kogan, Alexander
openaire   +1 more source

A note about k -DNF resolution

Information Processing Letters, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On deterministic approximation of DNF

Algorithmica, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luby, M., Veličković, B.
openaire   +1 more source

Home - About - Disclaimer - Privacy