Browsing Computer Science and Engineering by Title

Browsing Computer Science and Engineering by Title

Sort by: Order: Results:

  • Jeusfeld, Manfred A.; Karlapalem, Kamalakar (Springer, 2015)
  • 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 ...
  • 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. ...
  • Sinha, Sujata; Miyapuram, Krishna P.; Karlapalem, Kamalakar (Indian Institute of Technology Madras, 2017-03-09)
  • Dasgupta, Anirban; Kumar, Ravi; Sarlós, Tamás (2017-04-03)
  • Das, Bireswar; Scharpfenecker, Patrick; Toran, Jacobo (Elsevier, 2016-06)
    It is well-known that succinct encodings of computational problems – using circuits or formulas to encode large instances – generally result in an exponential complexity blow-up compared to their original complexity. We ...
  • Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Springer, 2016-02-08)
    In this paper, we study the Shortest Color Spanning Intervals problem, and related generalizations, namely Smallest Color Spanning t Squares and Smallest Color Spanning t Circles. The generic setting is the following: we ...
  • Arvind, V.; Das, Bireswar; Köbler, Johannes; Seinosuke, Toda (2010)
    We describe a xed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism which has running time 2 O (b)NO(1), where the parameter is the maximum size of the color classes of the given hypergraphs and N ...
  • Arvind, V.; Das, Bireswar; Kobler, Johannes; Toda, Seinosuke (Springer, 2013-04)
    We describe a fixed parameter tractable (fpt) algorithm for Colored Hypergraph Isomorphism, denoted CHI, which has running time (2 b N) O(1), where the parameter b is the maximum size of the color classes of the given ...
  • Patel, Reema; Borisaniya, Bhavesh; Patel, Avi; Patel, Dhiren R.; Rajarajan, Muttukrishnan; Zisman, Andrea (Springer, 2010)
    With the proliferation of universal clients over Internet, use of security protocols is rapidly on rise to minimize associated risks. Security protocols are required to be verified thoroughly before being used to secure ...
  • 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 ...
  • Patel, Dhiren R.; Pal, Om; Saiwan, S.; Jain, Pritish; Saquib, Zia (Institute of Electrical and Electronics Engineers (IEEE), 2009-12)
    SCADA (Supervisory Control And Data Acquisition) security has become a challenging issue today because of its connectivity with the outside world and remote access to the system. One critical security aspect for SCADA ...
  • Saxena, Anupam; Pal, Om; Saquib, Zia; Patel, Dhiren R. (Eswar Publications, 2010-03)
    Security of SCADA (supervisory Control and Data Acquisition) has become a challenging issue today because of its connectivity with the outside world and remote access to the system. One major challenge in the SCADA systems ...
  • Miyapuram, Krishna Prasad; Chawla, Manisha (Association for Cognitive Science, 2015)
  • Modi, Chirag; Rao, Udai Pratap; Patel, Dhiren R. (2010-07-12)
  • Dey, Palash; Misra, Neeldhara (New York Hilton Midtown, 2016-07)
  • Dwivedi, Utkarsh; Dasgupta, Anirban (ACM DEV, 2015-12)
  • 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 ...
  • Tinna, Pallav; Karlapalem, Kamalakar (Society for Imaging Science and Technology, 2016-02-14)
    Interactive visualization and analysis of the class boundaries is important because it tells us how and why the classes differ. However, the problem of modeling the boundary of classes of arbitrary size, shape and density ...
  • Garg, Dinesh; Jain, Alankar; Borkar, Vivek (Springer Vienna, 2016-08)
    We consider the problem of inferring the source of a rumor in a given large network. We assume that the rumor propagates in the network through a discrete time susceptible-infected model. Input to our problem includes ...

Search Digital Repository


Browse

My Account