Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • Goyal, Navin; Gupta, Manoj (Cornell University Library, 2016-01)
    In their seminal paper [Sleator and Tarjan, J.ACM, 1985], the authors conjectured that the splay tree is dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Banerjee, Suman; Pal, Bithika (Cornell University Library, 2020-04)
    Given a graph, and a set of query vertices (subset of the vertices), the dynamic skyline query problem returns a subset of data vertices (other than query vertices) which are not dominated by other data vertices based on ...
  • Banerjee, Suman; Jenamani, Mamata; Pratihar, Dilip Kumar (Cornell University Library, 2020-04)
    Given a social network with nonuniform selection cost of the users, the problem of \textit{Budgeted Influence Maximization} (BIM in short) asks for selecting a subset of the nodes within an allocated budget for initial ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Misra, Neeldhara; Mittal, Harshil (Cornell University Library, 2020-05)
    We study the problem of Imbalance parameterized by the twin cover of a graph. We show that Imbalance is XP parameterized by twin cover, and FPT when parameterized by the twin cover and the size of the largest clique outside ...
  • 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}. ...
  • Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2017-04)
  • 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 ...
  • 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 ...
  • Bhimaraju, Akhil; Nayak, Debanuj; Vaze, Rahul (Cornell University Library, 2020-04)
    The coflow scheduling problem is considered: given an input/output switch with each port having a fixed capacity, find a scheduling algorithm that minimizes the weighted sum of the coflow completion times respecting the ...

Search Digital Repository


Browse

My Account