نتایج جستجو برای: theoretical formulation
تعداد نتایج: 399232 فیلتر نتایج به سال:
We list a collection of open problems in real analysis in computer science, which complements, updates and extends a previous list curated by Ryan O’Donnell (2012). The object of study in these problems are boolean functions f : {0, 1} → {0, 1}, and their analytic and combinatorial properties. Many of the questions originate from in theoretical computer science or the theory of voting. The form...
Received (received date) Revised (revised date) We present a simple way to quantize the well-known Margulis expander map. The result is a quantum expander which acts on discrete Wigner functions in the same way the classical Margulis expander acts on probability distributions. The quantum version shares all essential properties of the classical counterpart, e.g., it has the same degree and spec...
In this paper we discuss certain theoretical properties of algorithm selection approach to image processing and to intelligent system in general. We analyze the theoretical limits of algorithm selection with respect to the algorithm selection accuracy. We show the theoretical formulation of a crisp bound on the algorithm selector precision guaranteeing to always obtain better than the best avai...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید