A5073959131- Advanced Graph Theory Research
- Computational Geometry and Mesh Generation
- Optimization and Search Problems
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- Data Management and Algorithms
- Advancements in Semiconductor Devices and Circuit Design
- Genome Rearrangement Algorithms
- Digital Image Processing Techniques
- Automated Road and Building Extraction
- Algorithms and Data Compression
- Modular Robots and Swarm Intelligence
- Semiconductor materials and devices
- Interactive and Immersive Displays
- Network Security and Intrusion Detection
- Model-Driven Software Engineering Techniques
- Tactile and Sensory Interactions
- Microgrid Control and Optimization
- Silicon Carbide Semiconductor Technologies
- Geographic Information Systems Studies
- Advanced Numerical Analysis Techniques
- Context-Aware Activity Recognition Systems
- Access Control and Trust
- Constraint Satisfaction and Optimization
- Digital Innovation in Industries
Birla Institute of Technology and Science, Pilani
2024
Birla Institute of Technology and Science, Pilani - Goa Campus
2024
University of Warwick
2022-2023
University of California, Irvine
2017-2021
Ben-Gurion University of the Negev
2018-2021
Samsung (South Korea)
2019
Delhi Technological University
2018
University of California System
2016
University of Illinois Urbana-Champaign
2013-2015
Institute of Medical Sciences
2014
Expansion in road network, motorization, and urbanization the country has been accompanied by a rise accidents leading to traffic injuries (RTIs). Today RTIs are one of causes deaths, disabilities, hospitalizations with severe socioeconomic costs across world.The following study analyses the: Age sex distribution injured (RTAs).Circumstances RTA.Pattern severity sustained RTAs cases.Retrospective record-based study.The aim this was audit retrospectively circumstances, severity, pattern...
There has been considerable success in developing strategies to detect insider threats information systems based on what one might call the random object access model or ROA. This approach models illegitimate users as ones who randomly records. The goal is use statistics, machine learning, knowledge of workflows and other techniques support an anomaly detection framework that finds such users. In this paper we introduce study a topic RTA aimed at whose may be but not fully because it focused...
The performance of the unbiased guard ring structure is measured and effects high current, emitter area, layout rings are reported explained. Measurements show a reduction in parasitic gain by up to six orders magnitude, while also avoiding cross talk power consumption biased rings. A comparative analysis with shows 100 times better at low current levels. modification implemented successfully tested which an increase handling capability order magnitude.
Embedded SRAM is a key component that typically determines the overall processor performance. A fully customized requires long design cycle; hence, an compiler can provide wide range of user-specified designs, by utilizing predefined leaf cells, widely used. An must exhibit robustness across voltage and temperature conditions. On top optimizing power performance for variety applications, also enables dynamic frequency scaling. However, sensitivity bitcell limits its operating range, thus...
Auditory menus can supplement or replace visual to enhance usability and accessibility. Despite the rapid increase of research on auditory displays, more is still needed optimize auditory-specific aspects these implementations. In particular, there are several menu attributes features that often displayed visually, but not poorly conveyed in version menu. Here, we report two studies aimed at determining how best render important concept an unavailable item. Study 1, 23 undergraduates...
The paper proposes a methodology to identify the most suitable sites for establishment of charging stations Electric Vehicles out available sites. To facilitate this identification, various factors pertaining cost, road dynamics, regional power etc. have been considered. This project has undertaken owing need well-planned network throughout region easy and convenient electric vehicles in near future.
We study the parameterized complexity of a variant classic video game Snake that models real-world problems motion planning. Given snake-like robot with an initial position and final in environment (modeled by graph), our objective is to determine whether can reach from without intersecting itself. Naturally, this problem wide-variety scenarios, ranging transportation linked wagons towed locomotor at airport or supermarket movement group agents travel “ant-like” fashion construction trains...
.An obstacle representation of a graph \(G\) consists set pairwise disjoint simply connected closed regions and one-to-one mapping the vertices to points such that two are adjacent in if only line segment connecting corresponding does not intersect any obstacle. The number is smallest obstacles an plane all simple polygons. It known each \(n\)-vertex \(O(n \log n)\) [M. Balko, J. Cibulka, P. Valtr, Discrete Comput. Geom., 59 (2018), pp. 143–164] there graphs whose \(\Omega (n/(\log n)^2)\)...
This paper studies planar drawings of graphs in which each vertex is represented as a point along sequence horizontal lines, called levels, and edge either segment or strictly $y$-monotone curve. A graph $s$-span weakly leveled if it admits such drawing where the edges have span at most $s$; an number levels touches minus one. We investigate problem computing from both computational combinatorial perspectives. prove to be para-NP-hard with respect its natural parameter $s$ complexity widely...
We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an $n$-vertex planar graph whose vertices are partitioned into independent sets (called clusters) paths - one for each cluster that connect all in while maintaining planarity. show can be solved time $2^{O(n)}$ both variable and fixed embedding case. Moreover, we it subexponential $2^{O(\sqrt{n}\log n)}$ case if additionally input connected. The latter complexity tight under Exponential-Time Hypothesis....
We provide an efficient algorithm for determining how a road network has evolved over time, given two snapshot instances from different dates. To allow such determinations across databases and even against hand drawn maps, we take strictly topological approach in this paper, so that compare networks based on graph-theoretic properties. Given of same region dates, our allows one to match portions remain intact also point out added or removed portions. analyze both theoretically, showing it...
The measurements of the effects high current, emitter area, and layout unbiased guard rings are reported explained. Measurements show a reduction parasitic gain by up to six orders magnitude, while also avoiding crosstalk power consumption biased rings.
Abstract For a clustered graph , i.e, whose vertex set is recursively partitioned into clusters, the C-Planarity Testing problem asks whether it possible to find planar embedding of and representation each cluster as region homeomorphic closed disk such that (1) subgraph induced by drawn in interior corresponding disk, (2) edge intersects any at most once, (3) nesting between clusters reflected representation, i.e., child are properly contained their parent cluster. The computational...