Zobrazeno 1 - 10
of 774
pro vyhledávání: '"Lonkar A"'
Autor:
Nikhilesh R., Aggarwal Shagun, Gupta Anubhav, Vardhan Arohi, Lonkar Aishwarya, Kumar Nithin, Rekha T, Unnikrishnan Bhaskaran, Mithra Prasanna, Holla Ramesh
Publikováno v:
Indian Journal of Community Medicine, Vol 49, Iss 7, Pp 51-51 (2024)
Background: The Medical Council of India (MCI) has proposed significant changes to the MBBS curriculum, including mandatory rural postings for undergraduate medical students, to address healthcare disparities. Understanding student attitudes towards
Externí odkaz:
https://doaj.org/article/5346ecab827046cd81ec9eab54c5fbf2
Autor:
Kamath, Akshay Karkal, Kumar, Bharath, Aggarwal, Sunil, Parameswaran, Subramanian, Lonkar, Parag, Prasanna, Debi, Sreenath, Somasunder
The development of a standard cell library involves characterization of a number of gate-level circuits at various cell-level abstractions. Verifying the behavior of these cells largely depends on the manual skills of the circuit designers. Especiall
Externí odkaz:
http://arxiv.org/abs/2406.00542
Set cover and hitting set are fundamental problems in combinatorial optimization which are well-studied in the offline, online, and dynamic settings. We study the geometric versions of these problems and present new online and dynamic algorithms for
Externí odkaz:
http://arxiv.org/abs/2303.09524
Autor:
Shisodiya, Mayur M.1, Lonkar, Vijaysinh D.1 vijaysinhlonkar@mafsu.in, Kadam, Avinash S.1, Mote, Chandrasekhar S.2, Jadhav, Sameer N.3, Kadam, Bapurao R.4
Publikováno v:
Indian Journal of Veterinary Sciences & Biotechnology. Sep/Oct2024, Vol. 20 Issue 5, p9-14. 6p.
In the Strip Packing problem (SP), we are given a vertical half-strip $[0,W]\times[0,\infty)$ and a set of $n$ axis-aligned rectangles of width at most $W$. The goal is to find a non-overlapping packing of all rectangles into the strip such that the
Externí odkaz:
http://arxiv.org/abs/2202.05989
Autor:
Laddha, Umesh D., Girase, Nikhil, Bhairav, Bhushan A., Lonkar, Vijay, Chalikwar, Shailesh S., Moravkar, Kailas K.
Publikováno v:
In European Journal of Medicinal Chemistry Reports August 2024 11
Autor:
Lonkar, Amogh, Beamer, Scott
Counting instances of specific subgraphs in a larger graph is an important problem in graph mining. Finding cliques of size k (k-cliques) is one example of this NP-hard problem. Different algorithms for clique counting avoid counting the same clique
Externí odkaz:
http://arxiv.org/abs/2112.10913
Developing a framework for the locomotion of a six-legged robot or a hexapod is a complex task that has extensive hardware and computational requirements. In this paper, we present a bio-inspired framework for the locomotion of a hexapod. Our locomot
Externí odkaz:
http://arxiv.org/abs/2107.11125
Autor:
Lonkar, Subodh
Over the centuries, humans have developed and acquired a number of ways to communicate. But hardly any of them can be as natural and instinctive as facial expressions. On the other hand, neural networks have taken the world by storm. And no surprises
Externí odkaz:
http://arxiv.org/abs/2107.08640