Results 121 to 130 of about 23,608 (225)
, 2020 Our main result is a deterministic learning algorithm with membership queries that learns a disjunctive normal form (DNF) with a polynomial number of terms within an additive approximation error in quasi polynomial time n^{O(logn)}. With random examples under the uniform distribution, the learning algorithm of [LMN93] for DNFs runs in time n^{O(log^2(n)
openaire +1 more source
Average case complexity of DNFs and Shannon semi-effect for narrow subclasses of boolean functions [PDF]
, 2015 Sergey Granin, Yura Maximov
openalex +1 more source
DNF-Net: A Deep Normal Filtering Network for Mesh Denoising [PDF]
, 2020 Xianzhi Li +4 more
openalex +1 more source
Dynamic Neuro-Fuzzy Vulnerability Detection System (DNF-VDS) [PDF]
A. B. Pawar, Anil B Pawar
openalex +1 more source
Learning DNF over the uniform distribution using a quantum example oracle [PDF]
, 1995 Nader H. Bshouty, Jeffrey C. Jackson
openalex +1 more source
Logical optimization of Boolean nets using Shannon expansion
Informatika, 2019 A synthesis of logical circuits, comprising functional combination blocks of very large scale integration circuits, is one of the most important tasks of computer-aided design.
P. N. Bibilo, Yu. Y. Lankevich
doaj
An Efficient Method for Converting Irregular Logical Formula into DNF/CNF with Graph Structure [PDF]
Sangmork Park
openalex +1 more source