#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1996

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Priyanka Mukhopadhyay, Bidyut Baran Chaudhuri
- Pattern Recognition
- 2015

In 1962 Hough earned the patent for a method [1], popularly called Hough Transform (HT) that efficiently identifies lines in images. It is an important tool even after the golden jubilee year of existence, as evidenced by more than 2500 research papers dealing with its variants, generalizations, properties and applications in diverse fields. The current… (More)

- Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
- ArXiv
- 2014

In this paper we present a new operational interpretation of relative-entropy between quantum states in the form of the following protocol. P: Alice gets to know the eigen-decomposition of a quantum state ρ. Bob gets to know the eigen-decomposition of a quantum state σ. Both Alice and Bob know S (ρσ) def = Trρ log ρ − ρ log σ, the relative entropy between ρ… (More)

- Soumendranath Chatterjee, Priyanka Mukhopadhyay, Raktima Bandyopadhyay, Paltu Dhal, Debraj Biswal, Prabir Kumar Bandyopadhyay
- Journal of parasitic diseases : official organ of…
- 2017

18S ribosomal RNA gene sequences of different species of Plasmodium were aligned and analyzed to determine the molecular diversity among different species of Plasmodium. AT content of P. cynomolgi, P. ovale, P. falciparum, P. vivax and P. malariae ranged from 62.30 to 63.15, 63.90 to 65.29, 66.67 to 68.40, 61.66 to 63.25 and 64.09 to 76.36 in case… (More)

- Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao
- IEEE Transactions on Information Theory
- 2016

In this paper, we present the following quantum compression protocol `P': Let ρ,σ be quantum states, such that S (ρ∥σ) <sup>def</sup>= Tr(ρ log ρ - ρ log σ), the relative entropy between ρ and σ, is finite. Alice gets to know the eigendecomposition of ρ. Bob gets to know the… (More)

- Priyanka Mukhopadhyay, Youming Qiao
- computational complexity
- 2016

Schubert polynomials were discovered by A. Lascoux and M. Schützenberger in the study of cohomology rings of flag manifolds in 1980s. These polynomials generalize Schur polynomials and form a linear basis of multivariate polynomials. In 2003, Lenart and Sottile introduced skew Schubert polynomials, which generalize skew Schur polynomials and expand in the… (More)

- Soumendranath Chatterjee, Priyanka Mukhopadhyay, Debarati Chakraborty, Tushar Kanti Dangar
- Proceedings of the National Academy of Sciences…
- 2016

Anopheles, Culex and Aedes mosquitoes are serious disease vectors in India including the malaria endemic saline mangrove delta of the Sundarbans, West Bengal. Their impact on the health and well being of the local population warrants more effective control measures. In the present study, spore forming soil bacteria were isolated from different areas of the… (More)

- Anurag Anshu, Dmitry Gavinsky, +5 authors Swagato Sanyal
- 2017

Let the randomized query complexity of a relation for error probability $\epsilon$ be denoted by $R_\epsilon(\cdot)$. We prove that for any relation $f \subseteq \{0,1\}^n \times \mathcal{R}$ and Boolean function $g:\{0,1\}^m \rightarrow \{0,1\}$, $R_{1/3}(f\circ g^n) = \Omega(R_{4/9}(f)\cdot R_{1/2-1/n^4}(g))$, where $f \circ g^n$ is the relation obtained… (More)

- P Mukhopadhyay
- 1996

The main purpose of this paper is to establish some necessary and suucient conditions for a semiring to be regular, in terms of its k-ideals.

- Priyanka Mukhopadhyay, Soumendranath Chatterjee
- Journal of parasitic diseases : official organ of…
- 2016

An investigation was done to find out the role of gut bacterium on the larval development and survival of Anopheles subpictus, the vector responsible for the transmission of malaria. An. subpictus mosquitoes breed exclusively in stagnant water, including shrimp/fish ponds with high nutrient level. One bacterial strain (CX2) was isolated from the midgut of… (More)

- Anurag Anshu, Naresh B. Goud, Rahul Jain, Srijita Kundu, Priyanka Mukhopadhyay
- Electronic Colloquium on Computational Complexity
- 2017

We show that for any (partial) query function f : {0, 1} n → {0, 1}, the randomized communication complexity of f composed with Index n m (with m = poly(n)) is at least the random-ized query complexity of f times log n. Here Index m : [m] × {0, 1} m → {0, 1} is defined as Index m (x, y) = y x (the xth bit of y). Our proof follows on the lines of Raz and… (More)

- ‹
- 1
- ›