Zobrazeno 1 - 10
of 1 419
pro vyhledávání: '"Gadekar A"'
Data summarization tasks are often modeled as $k$-clustering problems, where the goal is to choose $k$ data points, called cluster centers, that best represent the dataset by minimizing a clustering objective. A popular objective is to minimize the m
Externí odkaz:
http://arxiv.org/abs/2410.12913
Autor:
Filtser, Arnold, Gadekar, Ameet
The Capacitated Sum of Radii problem involves partitioning a set of points $P$, where each point $p\in P$ has capacity $U_p$, into $k$ clusters that minimize the sum of cluster radii, such that the number of points in the cluster centered at point $p
Externí odkaz:
http://arxiv.org/abs/2409.04984
Publikováno v:
ClinicoEconomics and Outcomes Research, Vol Volume 11, Pp 423-430 (2019)
Chaicharn Deerochanawong,1 Natapong Kosachunhanun,2 Arvind V Gadekar,3 Pitthaporn Chotikanokrat,3 Unchalee Permsuwan41Rajavithi Hospital, College of Medicine, Rangsit University, Ministry of Public Health, Bangkok 10400, Thailand; 2Department of Medi
Externí odkaz:
https://doaj.org/article/610dd06c29874b499cfd322172b132cb
In this work, we study diversity-aware clustering problems where the data points are associated with multiple attributes resulting in intersecting groups. A clustering solution need to ensure that a minimum number of cluster centers are chosen from e
Externí odkaz:
http://arxiv.org/abs/2401.05502
Autor:
Gadekar, Tukaram J.1 tukaramgadekar2010@rediffmail.com, Kaushik, Sushil K.2, Gadekar, Madhu3, Bobdey, Saurabh2, Dharmesh4
Publikováno v:
Indian Journal of Community Medicine. Nov/Dec2024, Vol. 49 Issue 6, p818-825. 9p.
This paper studies $k$-claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight independent set in this graph class. For the extremal question, we cons
Externí odkaz:
http://arxiv.org/abs/2308.16033
Autor:
Gadekar, Abhijit
With advancements in technology, the smaller versions of satellites have gained momentum in the space industry for earth monitoring and communication-based applications. The rise of CanSat technology has significantly impacted the space industry by p
Externí odkaz:
http://arxiv.org/abs/2308.03496
Autor:
Abbasi, Fateme, Banerjee, Sandip, Byrka, Jarosław, Chalermsook, Parinya, Gadekar, Ameet, Khodamoradi, Kamyar, Marx, Dániel, Sharma, Roohani, Spoerhase, Joachim
Publikováno v:
51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Leibniz International Proceedings in Informatics (LIPIcs), vol. 297, pp. 6:1--6:19, Schloss Dagstuhl -- Leibniz-Zentrum f\"ur Informatik, 2024
We consider the well-studied Robust $(k, z)$-Clustering problem, which generalizes the classic $k$-Median, $k$-Means, and $k$-Center problems. Given a constant $z\ge 1$, the input to Robust $(k, z)$-Clustering is a set $P$ of $n$ weighted points in a
Externí odkaz:
http://arxiv.org/abs/2305.07316
Autor:
Abbasi, Fateme, Banerjee, Sandip, Byrka, Jarosław, Chalermsook, Parinya, Gadekar, Ameet, Khodamoradi, Kamyar, Marx, Dániel, Sharma, Roohani, Spoerhase, Joachim
This paper considers the well-studied algorithmic regime of designing a $(1+\epsilon)$-approximation algorithm for a $k$-clustering problem that runs in time $f(k,\epsilon)poly(n)$ (sometimes called an efficient parameterized approximation scheme or
Externí odkaz:
http://arxiv.org/abs/2304.03146
Autor:
Anupama Pable, Ashish Gadekar, Mukund Lahoti, Shreyas Pranav, Alankar Sapkal, Deeksha Patil, Umesh Jadhav
Publikováno v:
Journal of Sustainable Construction Materials and Technologies, Vol 9, Iss 1, Pp 1-10 (2024)
The present study was undertaken to check the feasibility of magnesium phosphate cement (MPC) for the immobilization of calcite-precipitating bacteria. An aqueous route of MPC synthesis was followed using magnesium phosphate Mg3(PO4)2 powder and ammo
Externí odkaz:
https://doaj.org/article/9bc99b1ebe434282a669506b9a3c7124