نتایج جستجو برای: bounded l

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

Journal: :Journal of Graph Algorithms and Applications 2018

Let  $varpi$ be a representation of the homogeneous space $G/H$, where $G$ be a locally compact group and  $H$ be a compact subgroup of $G$. For  an admissible wavelet $zeta$ for $varpi$  and $psi in L^p(G/H), 1leq p <infty$, we determine a class of bounded  compact operators  which are related to continuous wavelet transforms on homogeneous spaces and they are called localization operators.

Journal: :iranian journal of fuzzy systems 2009
shen-qing jiang cong-hua yan

in this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. thena relation between totally fuzzy bounded sets and n-compactness is discussed.finally, a geometric characterization for fuzzy totally bounded sets in i- topologicalvector spaces is derived.

2009
Dainis Geidmanis Tomas Larfeldt

We consider way k tape alternating pushdown automata k apa and way k tape alternating nite automata k afa We say that an alternating automaton accepts a language L with f n bounded maximal respectively minimal leaf size if arbitrary re spectively at least one accepting tree for any w L has no more than f jwj leaves The main results of the article are the following For way k tape alternating cou...

Journal: :Bulletin of the American Mathematical Society 1979

Journal: :Transactions of the American Mathematical Society 1986

Journal: :Geometric And Functional Analysis 1998

2008
LARSEN LOUDER

It is shown that strict resolutions of Fn by F–limit groups have length bounded by 3n. As an application we show that the abelian analysis lattice of a limit group L has height bounded by 3 rk(L).

2010
Christian Senger Vladimir Sidorenko Martin Bossert Victor V. Zyablov

We investigate threshold–based multi–trial decoding of concatenated codes with an inner Maximum–Likelihood decoder and an outer error/erasure l+1 l –extended Bounded Distance decoder, i.e. a decoder which corrects ε errors and τ erasures if l+1 l ε+τ ≤ d−1, where d is the minimum distance of the outer code and l ∈ N\{0}. This is a generalization of Forney’s GMD decoding, which was considered on...

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

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