In this paper we study space-efficient deterministic population protocols for several variants of the majority problem including plurality consensus. We focus on space efficient majority protocols in populations with an arbitrary number of colours C represented by k-bit labels, where k = dlogCe. In particular, we present asymptotically space-optimal (with respect to the adopted k-bit representa...

The human visual system is able to accurately determine the color of objects irrespective of the spectral power distribution used to illuminate the scene. This ability to compute color constant descriptors is called color constancy. Many different algorithms have been proposed to solve the problem of color constancy. Usually, some assumptions have to be made in order to solve this problem. Algo...

The statistical analysis of functional data is a growing need in many research areas. We propose a new depth notion for functional observations based on the graphic representation of the curves. Given a collection of functions, it allows to establish the “centrality” of a function and provides a natural center-outward ordering of the sample curves. Robust statistics such as the median function ...

We show that Nechiporuk’s method [14] for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an Ω(n2/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [15] states that the majority function does not have a linear–size quantum formula.

We prove that a single threshold gate with arbitrary weights can be simulated by an explicit polynomial-size depth 2 majority circuit. In general we show that a depth d threshold circuit can be simulated uniformly by a majority circuit of depth d + 1. Goldmann, H astad, and Razborov showed in 10] that a non-uniform simulation exists. Our construction answers two open questions posed in 10]: we ...

The classes of the W-hierarchy are the most important classes of intractable problems in parameterized complexity. These classes where originally defined via the weighted satisfiability problem for Boolean circuits. Here, besides the Boolean connectives we consider connectives like majority, not-all-equal, and unique. For example, a gate labelled by the majority connective outputs TRUE if more ...

This paper is based on analysis of a common source - common gate low noise transconductance amplifier (CS-CG LNTA). Conventional noise analyses equations are modified by considering to the low output impedance of the sub-micron transistors and also, parasitic gate-source capacitance. The calculated equations are more accurate than calculated equations in other works. Also, analyses show that th...