Browsing Journal Articles by Title

Browsing Journal Articles by Title

Sort by: Order: Results:

  • Banerjee, Narayan; Majumder, Barun (Elsevier, 2016-03)
    With an explicit example, we show that Jordan frame and the conformally transformed Einstein frames clearly lead to different physics for a non-minimally coupled theory of gravity, namely Brans–Dicke theory, at least at ...
  • Echempati, Raghu; LeBlanc, Nathan Marshall; Sahu, Ankita; Dani, Theodore Paul (American Society for Engineering Education, 2014-04)
    In this paper, the teaching and learning experiences of the author with two summer interns at one of the educational institutions in India is presented. These are the senior mechanical engineering students from two ...
  • Patel, Dhiren R.; Khuba, Sidheshwar A. (Journal of Computing, 2009-12)
    Web blog is used as a collaborative platform to publish and share information. The information accumulated in the blog intrinsically contains the knowledge. The knowledge shared by the community of people has intangible ...
  • Patel, Diptiben; Nagar, Rajendra; Raman, Shanmuganathan (Elsevier, 2019-04)
    Reflection symmetry is one of the most commonly occurring and prominent visual attributes present in the real world. With an increase in the display devices of different sizes and aspect ratios, the images captured from ...
  • Das, Bireswar; Toran, Jacobo; Wagner, Fabian (Elsevier, 2012-08)
    The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time. We give restricted space algorithms for these problems proving the following ...
  • Banerjee, Suman; Jenamani, Mamata; Pratihar, Dilip Kumar (Springer Verlag, 2020-03)
    Given a social network with diffusion probabilities as edge weights and a positive integer k, which k nodes should be chosen for initial injection of information to maximize the influence in the network? This problem is ...
  • Allender, Eric; Das, Bireswar (Elsevier, 2017-10)
    We show that every problem in the complexity class (Statistical Zero Knowledge) is efficiently reducible to the Minimum Circuit Size Problem (). In particular Graph Isomorphism lies in . This is the first theorem ...

Search Digital Repository


Browse

My Account