𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simplification of Boolean-valued data by minimum covering

✍ Scribed by Jong C. Wang; Marlin H. Mickle; Ronald G. Hoelzeman

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
836 KB
Volume
12
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering skew-supermodular functions by
Covering skew-supermodular functions by hypergraphs of minimum total size
✍ Attila BernΓ‘th; TamΓ‘s KirΓ‘ly πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 1020 KB

The paper presents results related to a theorem of Szigeti on covering symmetric skew-supermodular set functions by hypergraphs. We prove the following generalization using a variation of Schrijver's supermodular colouring theorem: if p 1 and p 2 are skew-supermodular functions with the same maximum

Representations and rates of approximati
Representations and rates of approximation of real-valued Boolean functions by neural networks
✍ V. KΕ―rkovΓ‘; P. SavickΓ½; K. HlavÑčkovΓ‘ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 138 KB

We give upper bounds on rates of approximation of real-valued functions of d Boolean variables by one-hidden-layer perceptron networks. Our bounds are of the form c/ n p where c depends on certain norms of the function being approximated and n is the number of hidden units. We describe sets of funct

Existence of incomplete resolvable minim
Existence of incomplete resolvable minimum coverings of pairs by triples
✍ Hao Shen; Renwang Su; Dameng Deng πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 373 KB

For given positive integers u and v with u ≑ v ≑ 0 (mod 6), let IRC(u; v) denote an incomplete resolvable minimum covering of pairs by triples of order u having a hole of size v. It is proved in this paper that there exists such an IRC(u; v) if and only if u ΒΏ 3v.

Covering the Edges of a Graph by a Presc
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap
✍ Noga Alon; Yair Caro; Raphael Yuster πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over