نتایج جستجو برای: cf rank algorithm
تعداد نتایج: 842653 فیلتر نتایج به سال:
This work studies solution methods for approximating a given tensor by sum of R rank-1 tensors with one or more the latent factors being orthonormal. Such problem arises from applications such as image processing, joint singular value decomposition, and independent component analysis. Most existing algorithms are iterative type, while approximation type limited. By exploring multilinearity orth...
In this paperwe comparepronoun resolution algorithmsand introduce a centering algorithm(LeftRightCentering) that adheres to the constraints and rules of centering theory and is an alternative to Brennan, Friedman, and Pollard’s (1987) algorithm. We then use the Left-Right Centering algorithm to see if two psycholinguistic claims on Cf-list ranking will actually improve pronoun resolution accura...
This paper presents an algorithm that solves optimization problems on a matrix manifold M ⊆ Rm×n with an additional rank inequality constraint. The algorithm resorts to well-known Riemannian optimization schemes on fixed-rank manifolds, combined with new mechanisms to increase or decrease the rank. The convergence of the algorithm is analyzed and a weighted low-rank approximation problem is use...
We present an algorithm for computing a d-dimensional subspace of the row space of a matrix. For an n×n matrix A with m nonzero entries and with rank(A) ≥ d the algorithm generates a d × n matrix with full row rank and which is a subspace of Rows(A). If rank(A) < d the algorithm generates a rank(A)×n row-equivalent matrix. The running time of the algorithm is
Background. There are little comparative data on catheter ablation of paroxysmal atrial fibrillation (AF) using the contact force radiofrequency (CF-RF) catheter versus the second-generation cryoballoon (CB2). Methods and results. This is a single center, retrospective, nonrandomized study of 98 patients with symptomatic, drug-refractory paroxysmal AF who underwent their first PVI ablation usin...
Bounded symmetric domains (Cartan domains and exceptional domains) are higher-dimensional generalizations of the open unit disc. In this note we give a structure theory for the C*-algebra T generated by all Toeplitz operators Tf(h) := P{fh) with continuous symbol function ƒ G C(S) on the Shilov boundary 5 of a bounded symmetric domain D of arbitrary rank r. Here h belongs to the Hardy space H(S...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید