نتایج جستجو برای: multiplier bounded approximate identity

تعداد نتایج: 264048  

Journal: :Computer systems science and engineering 2023

Approximate computing is a popular field for low power consumption that used in several applications like image processing, video multimedia and data mining. This majorly performed with an arithmetic circuit particular multiplier. The multiplier the most essential element approximate where based on its performance. There are researchers worked reduction few decades, but design of not so easy. s...

2006
Joan Cerdà

If Tμ is a Fourier multiplier such that μ is any (possibly unbounded) symbol with uniformly bounded q-variation on dyadic coronas, we prove that the commutator [T, Tμ] = TTμ−TμT is bounded on the Besov space B p (R ), if T is any bounded linear operator on a couple of Besov spaces Bj ,rj p (R) (j = 0, 1, and 0 < σ1 < σ < σ0).

Journal: :Bulletin of The Australian Mathematical Society 2021

Abstract We prove that for a Banach algebra A having bounded $\mathcal {Z}(A)$ -approximate identity and every $\mathbf {[IN]}$ group G with weight w which is either constant on conjugacy classes or satisfies $w \geq 1$ , {Z}(L^{1}_{w}(G) \otimes ^{\gamma } A) \cong \mathcal {Z}(L^{1}_{w}(G)) . As an application, we discuss the conditions under {Z}(L^{1}_{\omega }(G,A))$ enjoys certain algebrai...

Journal: :Journal of Computational Physics 2023

A Radial Basis Function Generated Finite-Differences (RBF-FD) inspired technique for evaluating definite integrals over bounded volumes that have smooth boundaries in three dimensions is described. key aspect of this approach it allows the user to approximate value integral without explicit knowledge an expression boundary surface. Instead, a tesselation node set utilized inform algorithm domai...

Journal: :J. Symb. Log. 2007
Emil Jerábek

We develop approximate counting of sets definable by Boolean circuits in bounded arithmetic using the dual weak pigeonhole principle (dWPHP(PV )), as a generalization of results from [15]. We discuss applications to formalization of randomized complexity classes (such as BPP , APP , MA, AM ) in PV1 + dWPHP(PV ).

2013
Shikha Anand Anil Kishore Saxena

CMOS scaling has reached to the level, where process variation has become significant problem hindering further scaling. Various approaches to mitigate process variation effect try to nullify at the cost of increased area/power consumption. There are some applications which accept small errors such as multimedia processing. Designing accurate circuit for these applications is waste of area/powe...

Journal: :IEICE Transactions on Information and Systems 2022

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید