Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Pal, Manjish"'
Autor:
Pal, Manjish1 (AUTHOR), Pokhriyal, Subham2 (AUTHOR), Sikdar, Sandipan3 (AUTHOR) sandipan.sikdar@l3s.de, Ganguly, Niloy1 (AUTHOR)
Publikováno v:
Scientific Reports. 11/2/2023, Vol. 13 Issue 1, p1-15. 15p.
Autor:
Jaiswal, Shailesh Kumar, Medhi, Nabajyoti, Pal, Manjish, Sahu, Mridul, Sahu, Prashant, Sarma, Amal Dev
With the evolution of social networks, the network structure shows dynamic nature in which nodes and edges appear as well as disappear for various reasons. The role of a node in the network is presented as the number of interactions it has with the o
Externí odkaz:
http://arxiv.org/abs/1803.00263
In this paper we rederive an old upper bound on the number of halving edges present in the halving graph of an arbitrary set of $n$ points in 2-dimensions which are placed in general position. We provide a different analysis of an identity discovered
Externí odkaz:
http://arxiv.org/abs/1802.03730
Autor:
Verma, Amit Kumar, Pal, Manjish
A social network grows over a period of time with the formation of new connections and relations. In recent years we have witnessed a massive growth of online social networks like Facebook, Twitter etc. So it has become a problem of extreme importanc
Externí odkaz:
http://arxiv.org/abs/1509.05160
Autor:
Manne, Shiva, Pal, Manjish
In this paper, we present novel deterministic algorithms for multiplying two $n \times n$ matrices approximately. Given two matrices $A,B$ we return a matrix $C'$ which is an \emph{approximation} to $C = AB$. We consider the notion of approximate mat
Externí odkaz:
http://arxiv.org/abs/1408.4230
Autor:
Medhi, Nabajyoti, Pal, Manjish
Coverage in 3D wireless sensor network (WSN) is always a very critical issue to deal with. Coming up with good coverage models implies more energy efficient networks. $K$-coverage is one model that ensures that every point in a given 3D Field of Inte
Externí odkaz:
http://arxiv.org/abs/1401.0200
In this paper, we prove that most of the boolean functions, $f : \{-1,1\}^n \rightarrow \{-1,1\}$ satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai (Proc. AMS'96). The conjecture says that the Entropy of a boolean funct
Externí odkaz:
http://arxiv.org/abs/1110.4301
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs $G = (V, E)$. The best known algorithm for this problem till date runs in $O(m \sqrt{n})$ time due to Micali and Vazirani \cite{MV80}. Even for g
Externí odkaz:
http://arxiv.org/abs/1107.2482
Autor:
Pal, Manjish
The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new directions of p
Externí odkaz:
http://arxiv.org/abs/1011.4401
Publikováno v:
Database and Expert Systems Applications (DEXA) 2009
Statistical distance measures have found wide applicability in information retrieval tasks that typically involve high dimensional datasets. In order to reduce the storage space and ensure efficient performance of queries, dimensionality reduction wh
Externí odkaz:
http://arxiv.org/abs/0909.3169