An Algorithmic Approach to Uniform Lower Bound Conjectures

Abstract: Can computer modeling methods be used to design music instruments with improved intonation or response? Is that $6M Stradivarius violin really worth it? Why do clarinet and saxophone reeds wear out?

Quantum Computation with Noisy Superconducting Qubits

Talk

Speaker:

Abhinav Kandala

Time:

Friday, 26 April 2019, 14:30 to 15:30

Venue:

AG-69

Abstract: Improvements in the control and coherence of superconducting qubits have enabled the development of noisy intermediate-scale quantum (NISQ) processors, and the exploration of problems addressable by NISQ devices that are

Making a Global Mathematician

ASET Colloquium

Speaker:

Michael Barany

Time:

Thursday, 8 February 2018, 16:00 to 17:00

Venue:

AG-69

Webpage:

http://mbarany.com/

Between 1947 and 1950, French mathematician Laurent Schwartz went from being virtually unknown outside of France to an international mathematical celebrity.

Coarse Geometry of Random Metric Subspaces of Euclidean Spaces and Connections to Dependent Percolation

Special Mathematics Colloquium

Speaker:

Riddhipratim Basu

Time:

Wednesday, 28 December 2016, 16:00 to 17:00

Venue:

AG-69

Webpage:

http://web.stanford.edu/~rbasu/

Two metric spaces are said to be quasi isometric if their metrics are equivalent up to multiplicative and additive constants. This notion, introduced by Gromov (1981) for

Hardness of Approximate Coloring

PhD Thesis Seminar

Speaker:

Girish Varma

Time:

Friday, 8 January 2016, 14:00 to 15:00

Venue:

AG-69

Webpage:

http://www.weizmann.ac.il/pages/search/people?language=english&single=1&person_i...

Stable Point Processes, Branching Random Walks and a Prediction of Brunet and Derrida

STCS Seminar

Speaker:

Parthanil Roy

Organisers:

Sandeep K Juneja

Time:

Friday, 14 August 2015, 16:00 to 17:00

Venue:

AG-69

Webpage:

https://sites.google.com/site/parthanilroy/

Abstract: Stable point processes were introduced and characterized by Davydov, Molchanov and Zuyev (2008).

Greedy Recovery Algorithms in Compressive Sensing: A Review and Some New Results

STCS Seminar

Speaker:

Mrityunjoy Chakraborty

Organisers:

Arkadev Chattopadhyay

Time:

Monday, 2 March 2015, 14:30 to 15:30

Venue:

AG-69

Webpage:

http://www.ecdept.iitkgp.ernet.in/faculty/MChakraborty/

Abstract: Compressed sensing or compressive sampling (CS) is a powerful technique to represent signals at a sub-Nyquist sampling rate while retaining the capacity of perfect (or near perfect) reconstruction of the signal, provided the signal is kn

Information Geometry of the Robust Maximum Mean Power Likelihood Estimation

STCS Seminar

Speaker:

Rajesh Sundaresan

Organisers:

Vinod M. Prabhakaran

Time:

Tuesday, 20 January 2015, 13:45 to 14:45

Venue:

AG-69

Webpage:

http://www.ece.iisc.ernet.in/~rajeshs/

Abstract: The maximum "mean power" likelihood estimation procedure (proposed by [Basu et al., Biometrika, 1998]) is a robust variant of the maximum likelihood estimation procedure.

Search form

Speaker:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Webpage:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Time:

Venue:

Speaker:

Time:

Venue:

Webpage:

Speaker:

Time:

Venue:

Webpage:

Speaker:

Time:

Venue:

Webpage:

Speaker:

Organisers:

Time:

Venue:

Webpage:

Speaker:

Organisers:

Time:

Venue:

Webpage:

Speaker:

Organisers:

Time:

Venue:

Webpage:

Pages