Zobrazeno 1 - 10
of 39 098
pro vyhledávání: '" Sudan"'
We explore the use of local algorithms in the design of streaming algorithms for the Maximum Directed Cut problem. Specifically, building on the local algorithm of Buchbinder et al. (FOCS'12) and Censor-Hillel et al. (ALGOSENSORS'17), we develop stre
Externí odkaz:
http://arxiv.org/abs/2411.18829
We study the inference of network archaeology in growing random geometric graphs. We consider the root finding problem for a random nearest neighbor tree in dimension $d \in \mathbb{N}$, generated by sequentially embedding vertices uniformly at rando
Externí odkaz:
http://arxiv.org/abs/2411.14336
In this paper, we construct new t-server Private Information Retrieval (PIR) schemes with communication complexity subpolynomial in the previously best known, for all but finitely many t. Our results are based on combining derivatives (in the spirit
Externí odkaz:
http://arxiv.org/abs/2411.11611
Autor:
Amireddy, Prashanth, Behera, Amik Raj, Paraashar, Manaswi, Srinivasan, Srikanth, Sudan, Madhu
In this work, we show that the class of multivariate degree-$d$ polynomials mapping $\{0,1\}^{n}$ to any Abelian group $G$ is locally correctable with $\widetilde{O}_{d}((\log n)^{d})$ queries for up to a fraction of errors approaching half the minim
Externí odkaz:
http://arxiv.org/abs/2411.07374
Motivated by recent advances in locally testable codes and quantum LDPCs based on robust testability of tensor product codes, we explore the local testability of tensor products of (an abstraction of) algebraic geometry codes. Such codes are paramete
Externí odkaz:
http://arxiv.org/abs/2410.22606
This research investigates biases in text-to-image (TTI) models for the Indic languages widely spoken across India. It evaluates and compares the generative performance and cultural relevance of leading TTI models in these languages against their per
Externí odkaz:
http://arxiv.org/abs/2408.00283
A $(1 \pm \epsilon)$-sparsifier of a hypergraph $G(V,E)$ is a (weighted) subgraph that preserves the value of every cut to within a $(1 \pm \epsilon)$-factor. It is known that every hypergraph with $n$ vertices admits a $(1 \pm \epsilon)$-sparsifier
Externí odkaz:
http://arxiv.org/abs/2407.03934
Autor:
Maji, Moupiya, More, Surhud, Sule, Aniket, Balasubramanya, Vishaak, Bhandari, Ankit, Chand, Hum, Chavan, Kshitij, Dasgupta, Avik, De, Anindya, Gangopadhyay, Jayant, Gulati, Mamta, Hasan, Priya, Ishtiyaq, Syed, Madani, Meraj, Misra, Kuntal, N, Amoghavarsha, Oberoi, Divya, Pattnaik, Subhendu, Patwardhan, Mayuri, Ramanujam, Niruj Mohan, Ranadive, Pritesh, Sawant, Disha, Sharma, Paryag, Sharma, Twinkle, Shetye, Sai, Singhal, Akshat, Srivastava, Ajit M., Sudan, Madhu, Syed, Mumtaz, Vikranth, Pulamathi, Yadav, Virendra
We present the results of a nation-wide baseline survey, conducted by us, for the status of Astronomy education among secondary school students in India. The survey was administered in 10 different languages to over 2000 students from diverse backgro
Externí odkaz:
http://arxiv.org/abs/2406.12308
Autor:
Lalan, Arshika, Verma, Shresth, Diaz, Paula Rodriguez, Danassis, Panayiotis, Mahale, Amrita, Sudan, Kumar Madhu, Hegde, Aparna, Tambe, Milind, Taneja, Aparna
Harnessing the wide-spread availability of cell phones, many nonprofits have launched mobile health (mHealth) programs to deliver information via voice or text to beneficiaries in underserved communities, with maternal and infant health being a key a
Externí odkaz:
http://arxiv.org/abs/2407.12131
Autor:
Pokharel, Sudan, Roy, Tirthankar
Significant strides have been made in advancing streamflow predictions, notably with the introduction of cutting-edge machine-learning models. Predominantly, Long Short-Term Memories (LSTMs) and Convolution Neural Networks (CNNs) have been widely emp
Externí odkaz:
http://arxiv.org/abs/2404.07924