Author

Author

Sort by: Order: Results:

  • Chierichetti, Flavio; Das, Abhimanyu; Dasgupta, Anirban; Kumar, Ravi (IEEE, 2015-10-17)
    A set function on a ground set of size n is approximately modular if it satisfies every modularity requirement to within an additive error, approximate modularity is the set analog of approximate linearity. In this paper ...
  • Dasgupta, Anirban; Kumar, Ravi; Sarlós, Tamás (2017-04-03)
  • Choudhari, Jayesh; Dasgupta, Anirban; Bhattacharya, Indrajit; Bedathur, Srikanta (IEEE ICDM 2018IEEE, 2018-11-17)
    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 ...
  • 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 ...
  • Doshi, Ishita; Sajjalla, Sreekalyan; Choudhari, Jayesh; Bhatt, Rushi; Dasgupta, Anirban (Cornell University Library, 2020-08)
    We address the problem of large scale real time classification of content posted on social networks, along with the need to rapidly identify novel spam types. Obtaining manual labels for user generated content using editorial ...
  • Dwivedi, Utkarsh; Dasgupta, Anirban (ACM DEV, 2015-12)
  • Cormode, Graham; Dasgupta, Anirban; Goyal, Amit; Lee, Chi Hoon (Public Library of Science, 2018-01)
    Many modern applications of AI such as web search, mobile browsing, image processing, and natural language processing rely on finding similar items from a large database of complex objects. Due to the very large scale of ...
  • 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 ...
  • Sheth, Kshiteej; Garg, Dinesh; Dasgupta, Anirban (Springer, 2019-03)
    Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for ...
  • Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi (Cornell University Library, 2020-10)
  • Chhaya, Rachit; Dasgupta, Anirban; Shit, Supratim (Cornell University Library, 2020-06)
  • Dasgupta, Anirban; Kumar, Ravi; Sarlos, Tamas (2014-04-11)
  • Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi; Lattanzi, Silvio (ACM Digital Library, 2015-01-02)
    In this paper we consider the problem of learning a mixture of permutations, where each component of the mixture is generated by a stochastic process. Learning permutation mixtures arises in practical settings when a set ...
  • Das, Bireswar; Dasgupta, Anirban; Enduri, Murali Krishna; Reddy, Vinod.I (Elsevier, 2018-11)
    In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least
  • Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi; Lattanzi, Silvio (DROPS, 2014-09-04)
    The Mallows model is a classical model for generating noisy perturbations of a hidden permutation, where the magnitude of the perturbations is determined by a single parameter. In this work we consider the following ...
  • Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi; Lattanzi, Silvio; Sarlos, Tamas (2016-04)
  • Reza, Amit; Sengupta, Anand; Dasgupta, Anirban (15-01-2019)
  • Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Cornell University Library, 2017-05)
  • Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017-10-07)
    We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a breadth-first manner from a source, and ...
  • Dasgupta, Anirban; Sengupta, Srijan (Cornell University Library, 2020-07)
    Infectious or contagious diseases can be transmitted from one person to another through social contact networks. In today's interconnected global society, such contagion processes can cause global public health hazards, ...

Search Digital Repository


Browse

My Account