11 citations · 22 across the 10 of their papers we have counts for
11 papers
Learning from Satisfying Assignments Using Risk Minimization
Manjish Pal. Subham Pokhriyal
In this paper we consider the problem of Learning from Satisfying Assignments introduced by \cite{1} of finding a distribution that is a close approximation to the uniform distribu…
EvoCut : A new Generalization of Albert-Barabási Model for Evolution of Complex Networks
Shailesh Kumar Jaiswal, Nabajyoti Medhi, Manjish Pal +3
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 th…
Rederiving the Upper Bound for Halving Edges using Cardano's Formula
Pintu Chauhan, Manjish Pal, Napendra Solanki
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 points in 2-dimensions which are placed in gener…
Evolving Social Networks via Friend Recommendations
Amit Kumar Verma, Manjish Pal
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…
Fast Approximate Matrix Multiplication by Solving Linear Systems
Shiva Manne, Manjish Pal
In this paper, we present novel deterministic algorithms for multiplying two matrices approximately. Given two matrices we return a matrix which is an \emph…
Sixsoid: A new paradigm for -coverage in 3D Wireless Sensor Networks
Nabajyoti Medhi, Manjish Pal
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. -coverage…
The Entropy Influence Conjecture Revisited
Bireswar Das, Manjish Pal, Vijay Visavaliya
In this paper, we prove that most of the boolean functions, satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai (…
Maximum Matchings via Glauber Dynamics
Anant Jindal, Gazal Kochar, Manjish Pal
In this paper we study the classic problem of computing a maximum cardinality matching in general graphs . The best known algorithm for this problem till date runs in $…
Combinatorial Geometry of Graph Partitioning - I
Manjish Pal
The {\sc -Balanced Separator} problem is a graph-partitioning problem in which given a graph , one aims to find a cut of minimum size such that both the sides of the cut have…
On Low Distortion Embeddings of Statistical Distance Measures into Low Dimensional Spaces
Arnab Bhattacharya, Purushottam Kar, Manjish Pal
Statistical distance measures have found wide applicability in information retrieval tasks that typically involve high dimensional datasets. In order to reduce the storage space an…
Towards an -Approximation Algorithm for {\sc Balanced Separator}
Manjish Pal
The {\sc -Balanced Separator} problem is a graph-partitioning problem in which given a graph , one aims to find a cut of minimum size such that both the sides of the cut have…