IIIT-Delhi Institutional Repository

Browsing Computer Science and Engineering by Title

Browsing Computer Science and Engineering by Title

Sort by: Order: Results:

  • Caur, Samiya; Kumaraguru, Ponnurangam (Advisor) (IIIT- Delhi, 2021-05)
    Ever since the 2014 Lok Sabha election, social media platforms such as Twitter, Facebook etc.have become a vital part of election campaigns in India with political parties investing heavily in the expansion of their ...
  • Agarwal, Ayush; Sinha, Akshat; Arora, Chetan (Advisor); Gupta, Anubha (IIIT-Delhi, 2017-04-18)
    The automated segmentation of Brain MRI is an important initial step in the application of anomaly detection and pain localization due to neurological diseases. In this view, we aim to segment the sub structures (Caudate, ...
  • Asthana, Siddhartha; Singh, Pushpendra (Advisor) (IIIT-Delhi, 2017-01)
    Enabling support for information exchange has a great impact on the development of different sections of the society. Mobile phones using telecommunication services have enabled such support in several scenarios including ...
  • Prakash, Divay; Kumar, Hemant (Advisor) (IIIT-Delhi, 2017-04-18)
    The building management HVAC(heating, ventilation and air conditioning) system for Phase II of IIIT-Delhi campus is designed to take care (and advantage) of diversity of use. Instead of using large AHUs(Air Handling ...
  • Kumar, Piyush; Chakravarty, Sambuddho (Advisor); Maity, Mukulika (Advisor) (IIIT- Delhi, 2021-08)
    Free and open communication over the Internet is essential for the overall advancement of modern societies. However, there are numerous ways with which malevolent adversaries try to control the flow of information, by ...
  • Agarwal, Anshika; Gosain, Devashish; Acharya, Hrishikesh Bhatt; Chakravarty, Sambuddho (2016-09-23)
    Censorship of the Internet by government is a hotly contested topic. Some nations lean more toward free speech; others are much more conservative. How feasible is it for a government to censor the Internet? What mechanisms ...
  • Agarwal, Anshika; Chakravarty, Sambuddho (Advisor) (2016-09-15)
    Censorship of the Internet by government is a hotly contested topic. Some nations lean more towards free speech; others are much more conservative. How feasible is it for a government to censor the Internet? What mechanisms ...
  • Jain, Prachi; Kumaraguru, Ponnurangam (Advisor) (2014-07-10)
    There is a great concern about the potential for people to leak private information on social networks. There are many anecdotal examples of this, but few quantitative studies. This research explores the activity of ...
  • Verma, Ishita; Saran, Nitika; Arora, Chetan (Advisor) (IIIT-Delhi, 2017-04-18)
    Pose estimation is a fundamental problem in computer vision and is prevalent in numerous applications such as object-detection, tracking etc. Generally, in pose estimation between two camera views, we have 6 degrees of ...
  • Lamba, Hemank; Sarkar, Ankit; Vatsa, Mayank; Singh, Richa (2012-03-26)
    One of the major challenges of face recognition is to de- sign a feature extractor that reduces the intra-class vari- ations and increases the inter-class variations. The fea- ture extraction algorithm has to be robust ...
  • Prasad, Yashdeep; Shukla, Jainendra (Advisor) (IIIT-Delhi, 2021-12)
    Billions of online video ads are viewed every month. We aim present a large scale dataset of the response of Indian audience to the online advertisements. The project is an attempt to find a causality between popularity ...
  • Nambiar, Pranav; Arora, Chetan (Advisor); Anand, Saket (Advisor) (IIITD-Delhi, 2018-04-30)
    Text-to-speech systems generally require large amounts of annotated speech data with the quality of both the annotations and speech being a huge factor. As a result, most of the research performed has been on highly curated ...
  • Dewan, Prateek; Gupta, Mayank; Kumaraguru, Ponnurangam (2012-03-14)
    While passwords, by de nition, are meant to be secret, recent trends in the Internet usage have witnessed an increasing number of people sharing their email passwords for both personal and professional purposes. As ...
  • 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 ...
  • Mrinal; Gautam, Prutyay; Ray, Arjun (Advisor) (IIIT-Delhi, 2020-12)
    The project is based on applying Machine Learning tools and di erent analysis techniques to identify which protein features in metagenomes sampled from Human and Non-Human (other mammal species) microbiomes help them impart ...
  • Yadav, Kuldeep; Kumar, Amit; Bharti, Aparna; Naik, Vinayak (2013-10-10)
    Location data collected from mobile phone users provide an ideal platform to generate human mobility patterns. These patterns give us insights into how people travel in their dayto- day lives.With availability of cellular ...
  • Grover, Karan; Kumaraguru, Ponnurangam (Advisor) (2017-04-18)
    In social psychology, a rumor is defined as a story or statement in general circulation without confirmation or certainty to facts. Rumors are known to arise in the context of ambiguity, when the meaning of a situation is ...
  • Rawat, Madhur; Chakravarty, Sambuddho (Advisor) (2017-06)
    Cyberwarfare remains a sparsely explored domain of cybersecurity research, most often involving targeted attacks by one nation against another, using botnets. These botnets use malware to launch various kinds of attacks ...
  • Dubey, Manisha; Goyal, Vikram (Advisor) (2016-09-15)
    Bloom’s Taxonomy is a framework which acts as a reference for classification of questions across different cognitive levels such as Knowledge, Comprehension, Application, Analysis, Synthesis, and Evaluation. It can be used ...
  • Vinayak (IIIT- Delhi, 2021-06)
    Clique counting is a well studied problem in low memory models like graph streaming. There are algorithms which provide good space complexity bounds for general graphs. For constant pass, approximation algorithms counting ...

Search Repository


Advanced Search

Browse

My Account