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: Authentication & Internet security. 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: Authentication, Internet security, Wireless sensor network, Machine translation, Deep learning
Papers published on a yearly basis
Papers
More filters
••
17 Dec 2015
TL;DR: This paper revisits this time optimal control problem with continuity constraints in control and higher order motion derivatives and presents the motivation behind adopting a C∞ class of time scaling functions represented as parametric exponentials over more common polynomial forms.
Abstract: Computing time optimal motions along specified paths forms an integral part of the solution methodology for many motion planning problems. Conventionally, this optimal control problem is solved considering piece-wise constant parametrization for the control input which leads to convexity and sparsity in the optimization structure. However, it also results in discontinuous control trajectory which is difficult to track. Thus, in this paper we revisit this time optimal control problem with the primary motivation of ensuring a high degree of smoothness in the resulting motion profile. In particular, we solve it with continuity constraints in control and higher order motion derivatives like jerk, snap etc. It is clear that such constraints would necessitate the use of time varying control inputs over the commonly used piece-wise constant form. The primary contribution of the current work lies in the introduction of a C∞ class of time scaling functions represented as parametric exponentials. This in turn allows us to represent time varying control inputs as products of parametric exponential and a polynomial functions. We present the motivation behind adopting such representation of time scaling function over more common polynomial forms, both from mathematical as well as implementation standpoint. We also show that the proposed representation of time scaling function and control input leads to a very simple optimization structure where most of the constraints are linear. The non-linearity has a quasi-convex structure which can be reformulated into a simple difference of convex form. Thus, the resulting optimization can be efficiently solved through sequential convex programming where, at each iteration, the constraints in difference of convex form are further simplified to more conservative linear constraints.
16 citations
••
01 Apr 2017TL;DR: This paper presents manually annotated monolingual word similarity datasets of six Indian languages - Urdu, Telugu, Marathi, Punjabi, Tamil and Gujarati, and presents baseline scores for word representation models using state-of-the-art techniques by evaluating them on newly created word similarity dataset.
Abstract: With the advent of word representations, word similarity tasks are becoming increasing popular as an evaluation metric for the quality of the representations. In this paper, we present manually annotated monolingual word similarity datasets of six Indian languages - Urdu, Telugu, Marathi, Punjabi, Tamil and Gujarati. These languages are most spoken Indian languages worldwide after Hindi and Bengali. For the construction of these datasets, our approach relies on translation and re-annotation of word similarity datasets of English. We also present baseline scores for word representation models using state-of-the-art techniques for Urdu, Telugu and Marathi by evaluating them on newly created word similarity datasets.
16 citations
••
01 Aug 2017
TL;DR: This paper describes the system for detection and interpretation of English puns and provides detailed description of the approach, as well as the results obtained in the task.
Abstract: This paper describes our system for detection and interpretation of English puns. We participated in 2 subtasks related to homographic puns achieve comparable results for these tasks. Through the paper we provide detailed description of the approach, as well as the results obtained in the task. Our models achieved a F1-score of 77.65% for Subtask 1 and 52.15% for Subtask 2.
16 citations
•
01 Jan 2011TL;DR: A data structure for nding the set of dominating points inside a given orthogonal query rectangle given a set of n points in the plane is proposed, which supports 4-sided queries in O(logn +k), where k is size of the output, usingO(n logn) space.
Abstract: We consider the dominating point set reporting problem in two-dimension. We propose a data structure for nding the set of dominating points inside a given orthogonal query rectangle. Given a set of n points in the plane, it supports 4-sided queries in O(logn +k), where k is size of the output, usingO(n logn) space. This work can be of application when range queries are generated using mobile devices with limited display capacity.
16 citations
••
TL;DR: Not all servers are started at the request time to obtain the achievable task sizes on each server thus helping achieve lower task sizes which helps to reduce both the job completion time and the total server utilization.
Abstract: Coding theoretic techniques have been proposed for synchronous Gradient Descent (GD) on multiple servers to mitigate stragglers. These techniques provide the flexibility that the job is complete when any $k$ out of $n$ servers finish their assigned tasks. The task size on each server is found based on the values of $k$ and $n$ . However, it is assumed that all the $n$ jobs are started when the job is requested. In contrast, we assume a tiered system, where we start with $n_{1}\ge k$ tasks, and on completion of $c$ tasks, we start $n_{2}-n_{1}$ more tasks. The aim is that as long as $k$ servers can execute their tasks, the job gets completed. This paper exploits the flexibility that not all servers are started at the request time to obtain the achievable task sizes on each server. The task sizes are in general lower than starting all $n_{2}$ tasks at the request times thus helping achieve lower task sizes which helps to reduce both the job completion time and the total server utilization.
16 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 |