Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • Complexity of manipulation with partial information in Voting 
    Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)
    The Coalitional Manipulation problem has been studied extensively in the literature for many voting rules. However, most studies have focused on the complete information setting, wherein the manipulators know the votes of ...
  • DCIL: Deep Contextual Internal Learning for image restoration and image retargeting 
    Mastan, Indra Deep; Raman, Shanmuganathan (Cornell University Library, 2019-12)
    Recently, there is a vast interest in developing methods which are independent of the training samples such as deep image prior, zero-shot learning, and internal learning. The methods above are based on the common goal of ...
  • DeepPFCN: Deep Parallel Feature Consensus Network For Person Re-Identification 
    Singh, Shubham Kumar; Miyapuram, Krishna P.; Raman, Shanmuganathan (Cornell University Library, 2019-11)
    Person re-identification aims to associate images of the same person over multiple non-overlapping camera views at different times. Depending on the human operator, manual re-identification in large camera networks is ...
  • Depthwise-STFT based separable Convolutional Neural Networks 
    Kumawat, Sudhakar; Raman, Shanmuganathan (Cornell University Library, 2020-01)
    In this paper, we propose a new convolutional layer called Depthwise-STFT Separable layer that can serve as an alternative to the standard depthwise separable convolutional layer. The construction of the proposed layer is ...
  • Discovering topical interactions in text-based cascades using hidden Markov Hawkes processes 
    Bedathur, Srikanta; Bhattacharya, Indrajit; Choudhari, Jayesh; Dasgupta, Anirban (Cornell University Library, 2018-09)
    Social media conversations unfold based on complex interactions between users, topics and time. While recent models have been proposed to capture network strengths between users, users' topical preferences and temporal ...
  • The Entropy Influence Conjecture Revisited 
    Das, Bireswar; Pal, Manjish; Visavaliya, Vijay (arXiv, Cornell University Library, 2011-10)
    In this paper, we prove that most of the boolean functions, f : {−1, 1} n → {−1, 1}satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai(Proc. AMS’96)[1]. The conjecture says that the Entropy of ...
  • The evolving ecosystem of predatory journals: a case study in Indian perspective 
    Jain, Naman; Singh, Mayank (Cornell University Library, 2019-06)
    Digital advancement in scholarly repositories has led to the emergence of a large number of open access predatory publishers that charge high article processing fees from authors but fail to provide necessary editorial and ...
  • A framework for estimating stream expression cardinalities 
    Dasgupta, Anirban; Langy, Kevin; Rhodesz, Lee; Thalerx, Justin (Cornell University Library, 2015-10)
    Given [Math Processing Error] distributed data streams [Math Processing Error], we consider the problem of estimating the number of unique identifiers in streams defined by set expressions over [Math Processing Error]. We ...
  • Generic Single Edge Fault Tolerant Exact Distance Oracle 
    Gupta, Manoj; Singh, Aditi (Cornell University Library, 2018-05)
    Given an undirected unweighted graph G and a source set S of |S|=? sources, we want to build a data structure which can process the following query {\sc Q}(s,t,e): find the shortest distance from s to t avoiding an edge ...
  • Maximum Matchings via Glauber Dynamics 
    Jindal, Anant; Kochar, Gazal; Pal, Manjish (arXiv, Cornell University Library, 2011-07)
    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(mn√) time due to Micali and Vazirani \cite{MV80}. ...
  • Multiple source dual fault tolerant BFS trees 
    Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2017-04)
  • A new approach to deanonymization of unreachable bitcoin nodes 
    Mastan, Indra Deep; Paul, Souradyuti (International Association for Cryptologic Research, 2018-03)
    Mounting deanonymization attacks on the unreachable Bitcoin nodes -- these nodes do not accept incoming connections -- residing behind the NAT is a challenging task. Such an attack was first given by Biryukov, Khovratovich ...
  • NLPExplorer: exploring the universe of NLP papers 
    Parmar, Monarch; Jain, Naman; Jain, Pranjali; Sahit, P. Jayakrishna; Pachpande, Soham; Singh, Shruti; Singh, Mayank (Cornell University Library, 2019-10)
    Understanding the current research trends, problems, and their innovative solutions remains a bottleneck due to the ever-increasing volume of scientific articles. In this paper, we propose NLPExplorer, a completely automatic ...
  • On structural parameterizations of firefighting 
    Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-11)
    The Firefighting problem is defined as follows. At time t=0, a fire breaks out at a vertex of a graph. At each time step t?0, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all ...
  • On the parallel parameterized complexity of the graph isomorphism problem 
    Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2017-12)
    In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let H={H1,H2,?,Hl} be a finite set of graphs where |V(Hi)|?d for all i and for some ...
  • Parameterized algorithms for conflict-free colorings of graphs 
    Reddy, I. Vinod (Cornell University Library, 2017-09)
    In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...
  • The parameterized complexity of happy colorings 
    Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-08)
    Consider a graph G=(V,E) and a coloring c of vertices with colors from [ℓ]. A vertex v is said to be happy with respect to c if c(v)=c(u) for all neighbors u of v. Further, an edge (u,v) is happy if c(u)=c(v). Given a ...
  • A parameterized perspective on protecting elections 
    Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (Cornell University Library, 2019-05)
    We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and ...
  • PlantDoc: a dataset for visual plant disease detection 
    Singh, Davinder; Jain, Naman; Jain, Pranjali; Kayal, Pratik; Kumawat, Sudhakar; Batra, Nipun (Cornell University Library, 2019-11)
    India loses 35% of the annual crop yield due to plant diseases. Early detection of plant diseases remains difficult due to the lack of lab infrastructure and expertise. In this paper, we explore the possibility of computer ...
  • Polynomial-time algorithm for Isomorphism of graphs with clique-width at most 3 
    Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2015-06)
    The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the ...

Search Digital Repository


Browse

My Account