نتایج جستجو برای: rank k update
تعداد نتایج: 512739 فیلتر نتایج به سال:
In this paper, we study the block delivery delay of random linear network coding in two-hop single-unicast delay-tolerant networks with grid-based mobility. By block delivery delay, we mean how long it takes the destination to receive all the K information packets of a single block. Our work includes two parts. First, we give a general analysis of the dependency between packet spaces spanned by...
Search engines rank web pages according to different conditions. Some of them use publication time, some use last time of update, some checks the currency of the content of the web page. In this paper, a new algorithm is proposed which will work on the time of the web page, temporal information of the content and forms a binary tree to rank among web pages. GJCST-H Classification: H.2.8 H.3.3 A...
In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given m × n matrix A by a matrix B of rank at most k which is much smaller than m and n. The best rank k approximation can be determined via the singular value decomposition which, however, has prohibitively high computational complexity and storage requirements for very large m and...
For a global fieldK and an elliptic curve Eη overK(T ), Silverman’s specialization theorem implies rank(Eη(K(T ))) ≤ rank(Et(K)) for all but finitely many t ∈ P(K). If this inequality is strict for all but finitely many t, the elliptic curve Eη is said to have elevated rank. All known examples of elevated rank for K = Q rest on the parity conjecture for elliptic curves over Q, and the examples ...
We address the problem of preconditioning sequences of regularized KKT systems, such as those arising in interior point methods for convex quadratic programming. In this case, constraint preconditioners (CPs) are very effective and widely used; however, when solving large-scale problems, the computational cost for their factorization may be high, and techniques for approximating them appear as ...
Updating a linear least squares solution can be critical for near real-time signalprocessing applications. The Greville algorithm proposes simple formula updating the pseudoinverse of matrix A $\in$ R nxm with rank r. In this paper, we explicitly derive similar by maintaining general factorization, which call rank-Greville. Based on formula, implemented recursive exploiting rank-deficiency A, a...
We prove that the sum of the squared Euclidean distances from the n rows of an n×d matrix A to any compact set that is spanned by k vectors in R can be approximated up to (1+ε)-factor, for an arbitrary small ε > 0, using the O(k/ε)-rank approximation of A and a constant. This implies, for example, that the optimal k-means clustering of the rows of A is (1+ε)approximated by an optimal k-means cl...
A novel algorithm is proposed for CANDECOMP/PARAFAC tensor decomposition to exploit best rank-1 tensor approximation. Different from the existing algorithms, our algorithm updates rank-1 tensors simultaneously in-parallel. In order to achieve this, we develop new all-at-once algorithms for best rank-1 tensor approximation based on the Levenberg-Marquardt method and the rotational update. We sho...
Ranking temporal data has not been studied until recently, even though ranking is an important operator (being promoted as a firstclass citizen) in database systems. However, only the instant top-k queries on temporal data were studied in, where objects with the k highest scores at a query time instance t are to be retrieved. The instant top-k definition clearly comes with limitations (sensitiv...
We investigate finite-rank intersection type systems, analyzing the complexity of their type inference problems and their relation to the problem of recognizing semantically equivalent terms. Intersection types allow something of type τ1 ∧ τ2 to be used in some places at type τ1 and in other places at type τ2. A finite-rank intersection type system bounds how deeply the ∧ can appear in type exp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید