Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Kothapalli, Kishore"'
The effect of adjusting damping factor {\alpha}, from a small initial value {\alpha}0 to the final desired {\alpha}f value, upon then iterations needed for PageRank computation is observed. Adjustment of the damping factor is done in one or more step
Externí odkaz:
http://arxiv.org/abs/2108.04150
The effect of adjusting damping factor {\alpha} and tolerance {\tau} on iterations needed for PageRank computation is studied here. Relative performance of PageRank computation with L1, L2, and L{\infty} norms used as convergence check, are also comp
Externí odkaz:
http://arxiv.org/abs/2108.02997
Motivated by recent progress on symmetry breaking problems such as maximal independent set (MIS) and maximal matching in the low-memory Massively Parallel Computation (MPC) model (e.g., Behnezhad et al.~PODC 2019; Ghaffari-Uitto SODA 2019), we invest
Externí odkaz:
http://arxiv.org/abs/2009.12477
Sparse neural networks are shown to give accurate predictions competitive to denser versions, while also minimizing the number of arithmetic operations performed. However current hardware like GPU's can only exploit structured sparsity patterns for b
Externí odkaz:
http://arxiv.org/abs/2006.13486
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the boundary of the
Externí odkaz:
http://arxiv.org/abs/1307.5612
Autor:
Kothapalli, Kishore, Banerjee, Dip Sankar, Narayanan, P. J., Sood, Surinder, Bahl, Aman Kumar, Sharma, Shashank, Lad, Shrenik, Singh, Krishna Kumar, Matam, Kiran, Bharadwaj, Sivaramakrishna, Nigam, Rohit, Sakurikar, Parikshit, Deshpande, Aditya, Misra, Ishan, Choudhary, Siddharth, Gupta, Shubham
Parallel computing using accelerators has gained widespread research attention in the past few years. In particular, using GPUs for general purpose computing has brought forth several success stories with respect to time taken, cost, power, and other
Externí odkaz:
http://arxiv.org/abs/1303.2171
This paper initiates formal analysis of a simple, distributed algorithm for community detection on networks. We analyze an algorithm that we call \textsc{Max-LPA}, both in terms of its convergence time and in terms of the "quality" of the communities
Externí odkaz:
http://arxiv.org/abs/1210.3735
Autor:
Kothapalli, Kishore, Pemmaraju, Sriram
A $t$-ruling set of a graph $G = (V, E)$ is a vertex-subset $S \subseteq V$ that is independent and satisfies the property that every vertex $v \in V$ is at a distance of at most $t$ from some vertex in $S$. A \textit{maximal independent set (MIS)} i
Externí odkaz:
http://arxiv.org/abs/1207.3099
Distance bounding protocols are used by nodes in wireless networks to calculate upper bounds on their distances to other nodes. However, dishonest nodes in the network can turn the calculations both illegitimate and inaccurate when they participate i
Externí odkaz:
http://arxiv.org/abs/1003.5383