DSpace at IIIT-Delhi: Recent submissions

  • Bansal, Diksha; Sircar, Sarthok (Advisor) (IIIT-Delhi, 2021-03)
    In this thesis, we have explored the temporal and spatiotemporal stability analyses offree shear, viscoelastic flows in the limit of low to moderate Reynolds number (Re) and Weissenberg number (We). The description of the ...
  • Chauhan, Varsha; Sharma, Anuradha (Advisor) (IIIT-Delhi, 2021-01)
    Nowadays error-correcting codes are widely used in communication systems, returning pictures from deep space, designing registration numbers, and storage of data in memory systems. An important family of error-correcting ...
  • Singh, Gaurav; Ram, Shobha Sundar (Advisor) (IIIT-Delhi, 2020-07)
    We analyze the performance of a radar in an environment where clutter is constituted by discrete scatterers whose radar cross-sections are comparable to that of the target. An indoor radar deployment to detect humans in ...
  • Tyagi, Aakash; Grover, Anuj (Advisor); Rawat, Harsh (Advisor) (IIIT-Delhi, 2020-06)
    In recent years, there has been a very rapid advancement in the area of phase-changing materials, due to which there has been a substantial improvement in Phase-change memories (PCM) and its technology. Due to scaling ...
  • Bhattacharyya, Pramit; Mutharaju, Vijaya Raghava (Advisor) (2020-07)
    Building an ontology is not only a time-consuming process, but it is also confusing, especially for beginners and the inexperienced. Although ontology developers can take the help of domain experts in building an ontology, ...
  • Pandey, Yogesh; Goyal, Vikram (Advisor) (IIIT-Delhi, 2019-12)
    Congestion is one of the biggest problems which affects life quality and has an impact on social and economic conditions. Tackling traffic congestion has always been a challenge. The situation is more aggravated for ...
  • Gola, Nikhil; Goyal, Vikram (Advisor) (IIIT-Delhi, 2020-06)
    Traffic speed prediction is one of the challenging task and has many applications. Existing solutions either use crowd-sourced data or sophisticated technologies to perform the task, and hence are costly and unreliable. ...
  • Zaid, Kunwar; Ghatak, Gourab (Advisor) (IIIT-Delhi, 2020)
    The stationary multi-armed bandit (MAB) framework is a well-studied problem in literature, with many rigorous mathematical treatments and optimal solutions. However, for a non-stationary environment, i.e., when the reward ...
  • Aditi, K; Kaul, Sanjit Krishnan (Advisor) (IIIT-Delhi, 2020-07)
    Real-time monitoring applications have networks of Internet-of-Things (IoT) devices sense and communicate information from a scene of interest to a monitor, for example, a server in the cloud. Often the sensed information ...
  • Srivastava, Abhishek; Shah, Rajiv Ratn (Advisor); Yu, Yi (Advisor) (IIIT-Delhi, 2020-07)
    Automating the process of melody generation from lyrics has been a challenging research task in the field of artificial intelligence. Lately, however, music-related datasets have become available at large-scale, and with ...
  • Gupta, Neha; Prakash, Naveen (Advisor) (IIIT-Delhi, 2020-05)
    Conventional data warehouse systems are implemented either on a multi-dimensional database or a relational database. While the earlier supports MOLAP operations, the other supports ROLAP operations. In this work, we used ...
  • Yasvi, Maleeha Arif; Mutharaju, Vijaya Raghava (Advisor) (IIIT-Delhi, 2020-07)
    Ontologies evolve over time due to changes in the domain and the requirements of the application. Maintaining an ontology over time and keeping it up-to-date with respect to the changes in the domain and the requirements ...
  • Bhattacharya, Sudatta; Bera, Debajyoti (Advisor) (IIIT-Delhi, 2020-08-03)
    In this thesis we address the problem of computing closeness centrality, Harmonic centrality and a few related centrality measures that operate on the shortest paths in a graph. We consider sparse graphs, especially ...
  • Srivastava, Kshitij; Biyani, Pravesh (Advisor) (IIIT-Delhi, 2020-06)
    The concept of open data has become quite popular in recent times among governments and public-facing organizations promoting transparency and collaboration. In a similar expedition, the Open Transit Data Platform for Delhi ...
  • Sundriyal, Divyanshu; Vatsa, Mayank (Advisor); Singh, Richa (Advisor) (IIIT-Delhi, 2020-06)
    Deep learning systems require a large amount of labelled training dataset. However large amount of labelled data is not available in many cases as it requires considerable human effort to label each sample correctly. In ...
  • Yadav, Khushbu; Purandare, Rahul (Advisor) (IIIT-Delhi, 2020-08)
    Java being designed in a flexible and user-friendly demeanour, makes it the most accepted programming language for the development of web applications and platforms. Due to the immense popularity, there comes the responsibility ...
  • Sundriyal, Himanshu; Vatsa, Mayank (Advisor); Singh, Richa (Advisor) (IIIT-Delhi, 2020-06)
    Identifying face attributes is an ongoing problem of research which is used in bio-metrics, surveillance etc. In past, researchers have proposed methods which predict single facial attribute at a time. Real-time applications ...
  • Saxena, Garvita; Singh, Pushpendra (Advisor) (IIIT-Delhi, 2020)
    Most sensor based mobile phone applications like navigation systems, pothole detection, pedometers, traffic detection, etc. rely on the strict and stable positioning of the mobile phone at a particular place throughout ...
  • Tyagi, Arjun; Subramanyam, A V (Advisor) (IIIT-Delhi, 2020-08)
    Correlation filter (CF) based tracker often disregard or weakly incorporate the importance of feature channels as well as channel similarity. To address this, we propose a channel-graph regularization correlation filter-based ...
  • Makkar, Sakshi; Chakraborty, Tanmoy (Advisor) (IIIT-Delhi, 2020-07)
    Online hate speech, particularly over microblogging platforms like Twitter, has emerged as arguably the most severe issue of the past decade. Several countries have reported a steep rise in hate crimes infuriated by ...

Search Repository

Browse

My Account