نتایج جستجو برای: dense subspace

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

2018
Ruosong Wang David P. Woodruff

An lp oblivious subspace embedding is a distribution over r × n matrices Π such that for any fixed n× d matrix A, Pr Π [for all x, ‖Ax‖p ≤ ‖ΠAx‖p ≤ κ‖Ax‖p] ≥ 9/10, where r is the dimension of the embedding, κ is the distortion of the embedding, and for an n-dimensional vector y, ‖y‖p = ( ∑n i=1 |yi|) 1/p is the lp-norm. Another important property is the sparsity of Π, that is, the maximum numbe...

2013
Arnold W. Miller Konstantinos Beros

In his paper [1], Konstantinos Beros proved a number of results about compactly generated subgroups of Polish groups. Such a group is Kσ, the countable union of compact sets. He notes that the group of rationals under addition with the discrete topology is an example of a Polish group which is Kσ (since it is countable) but not compactly generated (since compact subsets are finite). Beros showe...

2009
Atsuto Maki Roberto Cipolla

Recovering the 3D surface of an object from shaded images has been long investigated in computer vision. A technique of using the shading variance due to object motion has been recently studied and attracts attention [3, 4, 8]. In this paper, we also concern ourselves with this technique because it allows us to stay with the simplest possible setup. The basic scheme of the technique is to emplo...

2005
H. P. ROSENTHAL

An algebra A of operators on a Banach space X is called strictly semitransitive if for all non-zero x, y ∈ X there exists an operator A ∈ A such that Ax = y or Ay = x. We show that if A is norm-closed and strictly semi-transitive, then every A-invariant linear subspace is norm-closed. Moreover, LatA is totally and well ordered by reverse inclusion. If X is complex and A is transitive and strict...

Journal: :IEEE Transactions on Information Theory 2016

Journal: :SIAM J. Scientific Computing 2013
Jared Tanner Ke Wei

Matrices of low rank can be uniquely determined from fewer linear measurements, or entries, than the total number of entries in the matrix. Moreover, there is a growing literature of computationally efficient algorithms which can recover a low rank matrix from such limited information, typically referred to as matrix completion. We introduce a particularly simple yet highly efficient alternatin...

Journal: :the modares journal of electrical engineering 2006
mostafa yargholi mojtaba lotfizad

different methods exists for jamming mitigation and we should choose a method based an the jammer type and other parameters. one of the jammers is narrow band fm jammer and we use subspace projection techniques for the suppression of this type of jammer. in subspace projection technique, we estimate the if of signals and construct the subspace vector that is orthogonal to jammer vector by incre...

2015
Pew-Thian Yap Yong Zhang Dinggang Shen

Diffusion magnetic resonance imaging (DMRI) is a powerful imaging modality due to its unique ability to extract microstructural information by utilizing restricted diffusion to probe compartments that are much smaller than the voxel size. Quite commonly, a mixture of models is fitted to the data to infer microstructural properties based on the estimated parameters. The fitting process is often ...

Let $mathcal{A}$ be a Banach algebra with BAI and $E$ be an introverted subspace of $mathcal{A}^prime$. In this paper we study the quotient Arens regularity of $mathcal{A}$ with respect to $E$ and prove that the group algebra $L^1(G)$ for a locally compact group $G$, is quotient Arens regular with respect to certain introverted subspace $E$ of $L^infty(G)$. Some related result are given as well.

The submodules with the property of the title ( a submodule $N$ of an $R$-module $M$ is called strongly dense in $M$, denoted by $Nleq_{sd}M$, if for any index set $I$, $prod _{I}Nleq_{d}prod _{I}M$) are introduced and fully investigated. It is shown that for each submodule $N$ of $M$ there exists the smallest subset $D'subseteq M$ such that $N+D'$ is a strongly dense submodule of $M$ and $D'bi...

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

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