Search Results - "Sen, Sayantan"

A (simple) classical algorithm for estimating Betti numbers by Apers, Simon, Gribling, Sander, Sen, Sayantan, Szabó, Dániel

“…We describe a simple algorithm for estimating the k -th normalized Betti number of a simplicial complex over n elements using the path integral Monte Carlo…”
Get full text

A comparative study of norethisterone and combined oral contraceptive pill in the treatment of dysfunctional uterine bleeding by Sen, Sayantan, Mandal, Tapan, Dutta, Arijit, Mondal, Himel, Khalua, Tufan

“…Background: A significant percentage of women in India suffer from dysfunctional uterine bleeding (DUB), which has a negative impact on physical and social…”
Get full text

Exploring the Gap between Tolerant and Non-tolerant Distribution Testing by Chakraborty, Sourav, Fischer, Eldar, Ghosh, Arijit, Mishra, Gopinath, Sen, Sayantan

“…The framework of distribution testing is currently ubiquitous in the field of property testing. In this model, the input is a probability distribution…”
Get full text

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information by Gayen, Sutanu, Kale, Sanket, Sen, Sayantan

“…Learning high-dimensional distributions is a significant challenge in machine learning and statistics. Classical research has mostly concentrated on asymptotic…”
Get full text

Verilog Modeling of 24 Bit Stereo DAC Using Multibit SDM by RoyChowdhury, Saikat, Sen, Sayantan

“…A 24-bit 96kHz sampling rate DAC (Digital-to-Analog Converter) achieves 106dB Dynamic Range. A 3 rd order 6bit ∑-∆ modulator is included (SDM). To reduce the…”
Get full text

Quantum property testing in sparse directed graphs by Apers, Simon, Magniez, Frédéric, Sen, Sayantan, Szabó, Dániel

“…We initiate the study of quantum property testing in sparse directed graphs, and more particularly in the unidirectional model, where the algorithm is allowed…”
Get full text

Near Uniform Triangle Sampling Over Adjacency List Graph Streams by Bishnu, Arijit, Ghosh, Arijit, Mishra, Gopinath, Sen, Sayantan

“…Triangle counting and sampling are two fundamental problems for streaming algorithms. Arguably, designing sampling algorithms is more challenging than their…”
Get full text

Testing Self-Reducible Samplers by Bhattacharyya, Rishiraj, Chakraborty, Sourav, Pote, Yash, Sarkar, Uddalok, Sen, Sayantan

“…Samplers are the backbone of the implementations of any randomised algorithm. Unfortunately, obtaining an efficient algorithm to test the correctness of…”
Get full text

A (simple) classical algorithm for estimating Betti numbers by Apers, Simon, Gribling, Sander, Sen, Sayantan, Szabó, Dániel

“…Quantum 7, 1202 (2023) We describe a simple algorithm for estimating the $k$-th normalized Betti number of a simplicial complex over $n$ elements using the…”
Get full text

Distribution Learning Meets Graph Structure Sampling by Bhattacharyya, Arnab, Gayen, Sutanu, John, Philips George, Sen, Sayantan, Vinodchandran, N. V

“…This work establishes a novel link between the problem of PAC-learning high-dimensional graphical models and the task of (efficient) counting and sampling of…”
Get full text

Testing of Index-Invariant Properties in the Huge Object Model by Chakraborty, Sourav, Fischer, Eldar, Ghosh, Arijit, Mishra, Gopinath, Sen, Sayantan

“…The study of distribution testing has become ubiquitous in the area of property testing, both for its theoretical appeal, as well as for its applications in…”
Get full text

Tolerant Bipartiteness Testing in Dense Graphs by Ghosh, Arijit, Mishra, Gopinath, Raychaudhury, Rahul, Sen, Sayantan

“…Bipartite testing has been a central problem in the area of property testing since its inception in the seminal work of Goldreich, Goldwasser and Ron [FOCS'96…”
Get full text

Exploring the Gap between Tolerant and Non-tolerant Distribution Testing by Chakraborty, Sourav, Fischer, Eldar, Ghosh, Arijit, Mishra, Gopinath, Sen, Sayantan

“…The framework of distribution testing is currently ubiquitous in the field of property testing. In this model, the input is a probability distribution…”
Get full text

A Faster Algorithm for Max Cut in Dense Graphs by Ghosh, Arijit, Mishra, Gopinath, Raychaudhury, Rahul, Sen, Sayantan

“…We design an algorithm for approximating the size of \emph{Max Cut} in dense graphs. Given a proximity parameter $\varepsilon \in (0,1)$, our algorithm…”
Get full text