Institution
International Institute of Information Technology, Hyderabad
Education•Hyderabad, India•
About: International Institute of Information Technology, Hyderabad is a education organization based out in Hyderabad, India. It is known for research contribution in the topics: Computer science & Authentication. The organization has 2048 authors who have published 3677 publications receiving 45319 citations. The organization is also known as: IIIT Hyderabad & International Institute of Information Technology (IIIT).
Topics: Computer science, Authentication, Deep learning, Artificial neural network, Internet security
Papers published on a yearly basis
Papers
More filters
••
04 Jun 2009TL;DR: The protocol provides non-repudiable identity verification, while not revealing any additional information about the user to the server or vice versa, and uses asymmetric encryption, and captures the advantages of biometric authentication.
Abstract: Biometric authentication over public networks leads to a variety of privacy issues that needs to be addressed before it can become popular. The primary concerns are that the biometrics might reveal more information than the identity itself, as well as provide the ability to track users over an extended period of time. In this paper, we propose an authentication protocol that alleviates these concerns. The protocol takes care of user privacy, template protection and trust issues in biometric authentication systems. The protocol uses asymmetric encryption, and captures the advantages of biometric authentication. The protocol provides non-repudiable identity verification, while not revealing any additional information about the user to the server or vice versa. We show that the protocol is secure under various attacks. Experimental results indicate that the overall method is efficient to be used in practical scenarios.
35 citations
••
TL;DR: A set of axioms of concords in preference orderings and a new class of concordance measures that outperform classic measures like Kendall's @t and W and Spearman's @r in sensitivity and apply to large sets of orderings instead of just to pairs of ordering are proposed.
35 citations
••
TL;DR: A detailed security analysis and comparative study reveal that the proposed AKMS-AgriIoT supports better security, and provides more functionality features, less communication costs and comparable computation costs as compared to other relevant schemes.
35 citations
••
01 Apr 2011TL;DR: In this paper, the authors proposed Doubly Cognitive WSN, which works by progressively allocating the sensing resources only to the most promising areas of the spectrum and is based on pattern analysis and learning.
Abstract: Scarcity of spectrum is increasing not only in cellular communication but also in wireless sensor networks. Adding cognition to the existing wireless sensor network WSN infrastructure has helped. As sensor nodes in WSN are limited with constraints like power, efforts are required to increase the lifetime and other performance measures of the network. In this article, the authors propose Doubly Cognitive WSN, which works by progressively allocating the sensing resources only to the most promising areas of the spectrum and is based on pattern analysis and learning. As the load of sensing resource is reduced significantly, this approach saves the energy of the nodes and reduces the sensing time dramatically. The proposed method can be enhanced by periodic pattern analysis to review the strategy of sensing. Finally the ongoing research work and contribution on cognitive wireless sensor networks in Communication Research Centre IIIT-H is discussed.
35 citations
••
01 Oct 2014TL;DR: This work proposes a novel search-based approach for greedy coreference resolution, where the mentions are processed in order and added to previous coreference clusters, and shows that the Prune-and-Score approach is superior to using a single scoring function to make both decisions and outperforms several state-of-the-art approaches on multiple benchmark corpora including OntoNotes.
Abstract: We propose a novel search-based approach for greedy coreference resolution, where the mentions are processed in order and added to previous coreference clusters. Our method is distinguished by the use of two functions to make each coreference decision: a pruning function that prunes bad coreference decisions from further consideration, and a scoring function that then selects the best among the remaining decisions. Our framework reduces learning of these functions to rank learning, which helps leverage powerful off-the-shelf rank-learners. We show that our Prune-and-Score approach is superior to using a single scoring function to make both decisions and outperforms several state-of-the-art approaches on multiple benchmark corpora including OntoNotes.
35 citations
Authors
Showing all 2066 results
Name | H-index | Papers | Citations |
---|---|---|---|
Ravi Shankar | 66 | 672 | 19326 |
Joakim Nivre | 61 | 295 | 17203 |
Aravind K. Joshi | 59 | 249 | 16417 |
Ashok Kumar Das | 56 | 278 | 9166 |
Malcolm F. White | 55 | 172 | 10762 |
B. Yegnanarayana | 54 | 340 | 12861 |
Ram Bilas Pachori | 48 | 182 | 8140 |
C. V. Jawahar | 45 | 479 | 9582 |
Saurabh Garg | 40 | 206 | 6738 |
Himanshu Thapliyal | 36 | 201 | 3992 |
Monika Sharma | 36 | 238 | 4412 |
Ponnurangam Kumaraguru | 33 | 269 | 6849 |
Abhijit Mitra | 33 | 240 | 7795 |
Ramanathan Sowdhamini | 33 | 256 | 4458 |
Helmut Schiessel | 32 | 117 | 3527 |