S
S. Sitharama Iyengar
Researcher at Indian Institute of Technology Ropar
Publications - 794
Citations - 15356
S. Sitharama Iyengar is an academic researcher from Indian Institute of Technology Ropar. The author has contributed to research in topics: Wireless sensor network & Key distribution in wireless sensor networks. The author has an hindex of 53, co-authored 776 publications receiving 13751 citations. Previous affiliations of S. Sitharama Iyengar include Jackson State University & Manipal Hospitals.
Papers
More filters
Book ChapterDOI
Spatial Data Characteristics
TL;DR: The use of GIS technology in engineering, in general, and in hydrology, in particular, has become feasible due primarily to the possibility of handling and integrating enormous amounts of geographic data efficiently.
Patent
Three dimensional touch conductive fabric
TL;DR: In this paper, a conductive fabric sensor is presented, which consists of an insulting and flexible fabric substrate, a central transmitting electrode on a top surface of the insulting and elastic fabric substrate and a plurality of receiving electrodes surrounding the central transmitting node.
Proceedings ArticleDOI
Fast multi-modal reuse: co-occurrence pre-trained deep learning models
Vasanth Iyer,Alexander Aved,Todd B. Howlett,Jeffrey T. Carlo,Asif Mehmood,Niki Pissinou,S. Sitharama Iyengar +6 more
TL;DR: A proximity matrix embedding part of the learning metric embedding which has entries showing the relations between co-occurrence frequency observed in input sets is proposed, which relates to a k-radius ball of nearest neighbors.
Posted Content
Liberty and Individualism in Gandhian Perspective Implications for Sustainability of Societies
TL;DR: Gandhian thought does not figure prominently in the development debate in the world in general and in the West in particular, because the Western thought has been polarised mainly into two ideologies: conservatism and socialism.
Nonlinear neural network for deterministic scheduling
TL;DR: A neuromorphic model is used to construct a non-preemptive optimal processing schedule such that the total completion time, total tarediness and the number of tardy jobs is minimized.