Community Detection in Networks: Algorithms, Complexity, and Information Limits STCS Seminar Speaker: Bruce HajekOrganisers: Sandeep K JunejaTime: Thursday, 11 August 2016, 11:30 to 12:30 Venue: A-201 (STCS Seminar Room) Webpage: https://www.ece.illinois.edu/directory/profile/b-hajek Read more about Community Detection in Networks: Algorithms, Complexity, and Information Limits
Bandlimited Field Estimation from Samples Recorded by Location-Unaware Sensors STCS Colloquium Speaker: Animesh KumarOrganisers: Rahul VazeTime: Tuesday, 9 August 2016, 16:00 to 17:00 Venue: A-201 (STCS Seminar Room) Webpage: https://www.ee.iitb.ac.in/~animesh/ Read more about Bandlimited Field Estimation from Samples Recorded by Location-Unaware Sensors
Measuring Global Financial Sector Health ASET Colloquium Speaker: Viral AcharyaTime: Friday, 5 August 2016, 16:00 to 17:00 Venue: AG-66 (Lecture Theatre) Webpage: http://pages.stern.nyu.edu/~sternfin/vacharya/ Read more about Measuring Global Financial Sector Health
Lightweight Formal Methods for LLVM Verification STCS Seminar Speaker: Santosh NagarakatteOrganisers: Ashutosh GuptaTime: Friday, 5 August 2016, 15:00 to 16:00 Venue: A-201 (STCS Seminar Room) Webpage: https://www.cs.rutgers.edu/~santosh.nagarakatte/ Read more about Lightweight Formal Methods for LLVM Verification
The Bit-probe Complexity of Set Membership PhD Thesis Seminar Speaker: Mohit Garg, TIFR Time: Wednesday, 3 August 2016, 11:30 to 12:30 Venue: AG-66 (Lecture Theatre) Read more about The Bit-probe Complexity of Set Membership
Randomized Sabotage Complexity STCS Student Seminar Speaker: Suhail Sherif, TIFR Organisers: Varun NarayananTime: Friday, 29 July 2016, 16:00 to 17:30 Venue: A-201 (STCS Seminar Room) Read more about Randomized Sabotage Complexity
Weierstrass Polynomial Approximation Theorem for $C[0,1]$ via Weak Law of Large Numbers STCS Seminar Speaker: Krishna Athreya Organisers: Sandeep K JunejaTime: Monday, 25 July 2016, 16:00 to 17:00 Venue: A-201 (STCS Seminar Room) Webpage: http://stat.iastate.edu/people/krishna-athreya Read more about Weierstrass Polynomial Approximation Theorem for $C[0,1]$ via Weak Law of Large Numbers
Progression-Free Sets in $Z_p^n$, and Applications STCS Student Seminar Speaker: Aditya PotukuchiOrganisers: Tulasi mohan MolliTime: Friday, 22 July 2016, 16:00 to 17:30 Venue: A-201 (STCS Seminar Room) Webpage: https://www.cs.rutgers.edu/people/directory.php?type=grad&netid=ap1311 In this talk, I would like to attempt to give a brief glimpse at and around the recent developments related to the Cap Sets problem: Read more about Progression-Free Sets in $Z_p^n$, and Applications
Subcubic Equivalences Between Matrix, Path and Triangle Problems STCS Student Seminar Speaker: Anamay Tengse, TIFR Organisers: Nikhil S MandeTime: Friday, 15 July 2016, 16:00 to 17:30 Venue: A-201 (STCS Seminar Room) In this talk, we will discuss subcubic equivalence between the following problems: Read more about Subcubic Equivalences Between Matrix, Path and Triangle Problems
New Parallel Algorithm for Bipartite Matching STCS Student Seminar Speaker: Tulasi mohan Molli, TIFR Organisers: Nikhil S MandeTime: Friday, 8 July 2016, 16:00 to 17:30 Venue: A-201 (STCS Seminar Room) Read more about New Parallel Algorithm for Bipartite Matching
