Results 121 to 130 of about 76,534 (153)
Visualizing Boolean Operations on a Hypercube
Mathematical and Computer Modelling, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +2 more sources
Boolean Autoencoders and Hypercube Clustering Complexity [PDF]
Designs, Codes, and Cryptography, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baldi, Pierre
exaly +4 more sources
Log Concavity and Concentration of Lipschitz Functions on the Boolean Hypercube [PDF]
Journal of Functional Analysis, 2022 It is well-known that measures whose density is the form $e^{-V}$ where $V$ is a uniformly convex potential on $\RR^n$ attain strong concentration properties. In search of a notion of log-concavity on the discrete hypercube, we consider measures on $\{-1,1\}^n$ whose multi-linear extension $f$ satisfies $\log \nabla^2 f(x) \preceq β\Id$, for $β\geq 0$,
Ronen Eldan, Omer Shamir
exaly +4 more sources
Boolean Automorphisms of a Hypercube Coincide With the Linear Isometries
Advances in Pure Mathematics, 2014 Boolean homomorphisms of a hypercube, which correspond to the morphisms in the category of finite Boolean algebras, coincide with the linear isometries of the category of finite binary metric vector spaces.
Marco V José
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An Analogue of Slepian Vectors on Boolean Hypercubes
Journal of Fourier Analysis and Applications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hogan, Jeffrey A., Lakey, Joseph D.
openaire +1 more source
On embedding ternary trees into Boolean hypercubes
[1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 2003It is pointed out that the problem of efficiently embedding a k-ary tree into hypercube with k>or=3 has largely remained unsolved, even though optimal embeddings (i.e. embeddings achieving minimum delta , lambda , and in ) of complete and incomplete binary trees into hypercubes have been known for some time. Thus, in their quest for designing efficient
Ajay K. Gupta 0001, Hong Wang
openaire +1 more source
Graph Embedding in Boolean Hypercube
2006 International Biennial Baltic Electronics Conference, 2006Huge effort has been invested to come up with a wide range of design solutions that help solving the power dissipation problem for synchronous sequential circuits. Particularly, this problem is reduced to optimal coding of states of a Finite State Machine (FSM) by Boolean vectors which present sets of memory element states. Two new methods to solve the
E. Fomina, A. Zakrevski
openaire +1 more source
Optimal expression evaluation and term matching on the Boolean hypercube and on hypercubic networks
Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94, 1994An optimal tree contraction algorithm for the Boolean hypercube and constant degree hypercubic networks, such as the shuffle exchange or the butterfly network, is presented. The algorithm is based on a recursive approach, uses novel routing techniques, and, for certain small subtrees, simulates optimal PRAM algorithms.
Ernst W. Mayr, Ralph Werchner
openaire +1 more source
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, 2021
The concept of conformal transformation is proposed through the study of the spatial structure of [Formula: see text]-dimensional hypercubes. Based on conformal transformation, a novel algorithm, called topological equivalence classification algorithm, is proposed for classifying balanced linearly separable Boolean functions. By the proposed algorithm,
Wei Jin, Qinbin He
exaly +3 more sources
The concept of conformal transformation is proposed through the study of the spatial structure of [Formula: see text]-dimensional hypercubes. Based on conformal transformation, a novel algorithm, called topological equivalence classification algorithm, is proposed for classifying balanced linearly separable Boolean functions. By the proposed algorithm,
Wei Jin, Qinbin He
exaly +3 more sources
Clustering in the Boolean Hypercube in a List Decoding Regime
2013We consider the following clustering with outliers problem: Given a set of points X⊂{−1,1}n, such that there is some point z∈{−1,1}n for which Prx∈X ≥ e] ≥ δ, find z. We call such a point z a (δ,e)-center of X. In this work we give lower and upper bounds for the task of finding a (δ,e)-center. We first show that for δ=1−ν close to 1, i.e.
Irit Dinur, Elazar Goldenberg
openaire +2 more sources