English
Related papers

Related papers: Classification of Boolean Functions where Affine F…

200 papers

Boolean network models of molecular regulatory networks have been used successfully in computational systems biology. The Boolean functions that appear in published models tend to have special properties, in particular the property of being…

Dynamical Systems · Mathematics 2024-07-09 Yuan Li , John O. Adeyeye , David Murrugarra , Boris Aguilar , Reinhard Laubenbacher

We propose a Bayesian approach to estimating parameters in multiclass functional models. Unordered multinomial probit, ordered multinomial probit and multinomial logistic models are considered. We use finite random series priors based on a…

Methodology · Statistics 2018-08-03 Xiuqi Li , Subhashis Ghosal

The problem of supervised classification (or discrimination) with functional data is considered, with a special interest on the popular k-nearest neighbors (k-NN) classifier. First, relying on a recent result by Cerou and Guyader (2006), we…

Machine Learning · Statistics 2008-06-18 Amparo Baillo , Antonio Cuevas

We address in this paper the following two closely related problems: 1. How to represent functions with singularities (up to a prescribed accuracy) in a compact way? 2. How to reconstruct such functions from a small number of measurements?…

Classical Analysis and ODEs · Mathematics 2007-11-01 Boris Ettinger , Niv Sarig , Yosef Yomdin

In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on $n$ bits that are liftings from Boolean functions on $k$ bits, for $k\leq n$. These functions generalize the well-known map used…

Combinatorics · Mathematics 2022-08-22 Tron Omland , Pantelimon Stanica

The question of obtaining well-defined criteria for multiple criteria decision making problems is well-known. One of the approaches dealing with this question is the concept of nonessential objective function. A certain objective function…

Optimization and Control · Mathematics 2008-11-08 Agnieszka B. Malinowska , Delfim F. M. Torres

In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering…

Combinatorics · Mathematics 2022-07-13 José Andrés Armario , Ronan Egan , Dane Flannery

Many researchers have studied symmetry properties of various Boolean functions. A class of Boolean functions, called nested canalyzing functions (NCFs), has been used to model certain biological phenomena. We identify some interesting…

Discrete Mathematics · Computer Science 2023-06-22 Daniel J. Rosenkrantz , Madhav V. Marathe , S. S. Ravi , Richard E. Stearns

Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4 {\log}^{O(1)}…

Data Structures and Algorithms · Computer Science 2017-01-25 Srikumar Ramalingam , Chris Russell , Lubor Ladicky , Philip H. S. Torr

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Probability · Mathematics 2015-12-31 Aviad Rubinstein , Muli Safra

The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is epsilon-far from having that property. The performance of the algorithm is judged by how many calls need to be made to…

Quantum Physics · Physics 2015-05-28 Mark Hillery , Erika Andersson

Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for bi-decomposition are often based on BDDs and, more recently,…

Logic in Computer Science · Computer Science 2011-12-15 Huan Chen , Mikolas Janota , Joao Marques-Silva

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

By using the theory of first-order differential subordination for functions with fixed initial coefficient, several well-known results for subclasses of univalent functions are improved by restricting the functions to have fixed second…

Complex Variables · Mathematics 2012-08-02 Sumit Nagpal , V. Ravichandran

There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…

Numerical Analysis · Mathematics 2016-10-06 Hayk Avdalyan , Hakop Hakopian

The ability to collect and store ever more massive databases has been accompanied by the need to process them efficiently. In many cases, most observations have the same behavior, while a probable small proportion of these observations are…

Statistics Theory · Mathematics 2021-09-21 Myrto Limnios , Nathan Noiry , Stéphan Clémençon

This paper discusses the use of absolutely one-homogeneous regularization functionals in a variational, scale space, and inverse scale space setting to define a nonlinear spectral decomposition of input data. We present several theoretical…

Numerical Analysis · Computer Science 2016-01-13 Martin Burger , Guy Gilboa , Michael Moeller , Lina Eckardt , Daniel Cremers

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

Computational Complexity · Computer Science 2025-02-27 Daniel M. Kane , Anthony Ostuni , Kewen Wu

We aim to completely formalize the rough topological analysis of integrable Hamiltonian systems admitting analytical solutions such that the initial phase variables along with the time derivatives of the auxiliary variables are expressed as…

Exactly Solvable and Integrable Systems · Physics 2013-09-30 Mikhail P. Kharlamov
‹ Prev 1 3 4 5 6 7 10 Next ›