Browsing Computer Science and Engineering by Title

Browsing Computer Science and Engineering by Title

Sort by: Order: Results:

  • Jia,Yiling; Batra,Nipun; Wang,Hongning (Cornell University Library, 2019-09)
    Residential homes constitute roughly one-fourth of the total energy usage worldwide. Providing appliance-level energy breakdown has been shown to induce positive behavioral changes that can reduce energy consumption by ...
  • Patel, Diptiben; Shanmuganathan, Srivathsan; Raman, Shanmuganathan (2019-02-20)
  • Jeusfeld, Manfred A.; Karlapalem, Kamalakar (Springer, 2015)
  • Jain, Naman; Jain, Pranjali; Kayal, Pratik; Sahit, Jayakrishna; Pachpande, Soham; Choudhari, Jayesh; Singh, Mayank (Department of Science and Technology Government of Gujarat, 2019-01-17)
  • 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 ...
  • Singh, Mayank; Sarkar, Rajdeep; Vyas, Atharva; Goyal, Pawan; Mukherjee, Animesh; Chakrabarti, Soumen (2019-04-17)
  • Bhatia, Udit (Wiley, 2019-05)
    Open science practices such as publishing data and code are transforming water science by enabling synthesis and enhancing reproducibility. However, as research increasingly bridges the physical and social science domains ...
  • Goyal, Navin; Gupta, Manoj (Elsevier, 2019-01)
    In their seminal paper Sleator and Tarjan (1985) [15], the authors conjectured that the splay tree is a dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. ...
  • 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 Prasad; Karlapalem, Kamalakar (Indian Institute of Technology Madras, 2017-03-09)
  • Ambavi, Heer; Garg, Ayush; Nitiksha; Sharma, Mridul; Sharma, Rohit; Choudhari, Jayesh; Singh, Mayank (2019-01-02)
  • Dasgupta, Anirban; Kumar, Ravi; Sarlós, Tamás (2017-04-03)
  • Das, Bireswar; Scharpfenecker, Patrick; Toran, Jacobo (Elsevier, 2017-04)
    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 ...
  • Banerjee, Sandip; Misra, Neeldhara; Nandy, Subhas C. (Elsevier, 2018-03)
    In this paper, we study the Shortest Color Spanning - Intervals problem, and related generalizations, namely Smallest Color Spanning - Squares and Smallest Color Spanning - Circles. The generic setting is the following: ...
  • 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, 2015-01)
    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 ...
  • Deya, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2018-03)
    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 ...

Search Digital Repository


Browse

My Account