Student Seminar

Data Structures for Storing Small Sets in the Bitprobe Model

Speaker: 

Saswata Shannigrahi School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha R

Time: 

Friday, 3 September 2010 (All day)

Venue: 

We study the following set membership problem in the bitprobe model: Given a set S from a finite universe U , represent it in memory so that membership queries of the form Is x in S? can be answered with a small number of bitprobes.

Perturbed Identity Matrices have High Rank: Proof and some Applications

Speaker: 

Kishor Barman School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road <b

Time: 

Friday, 14 May 2010 (All day)

Venue: 

We will discuss a lower bound (due to Noga Alon) on the rank of any real matrix in which all the diagonal entries are significantly larger (in absolute value) than all the other entries.

Probably Approximately CORRECT Learning

Speaker: 

Girish Varma Tata Institute of Fundamental Research School of Technology and Computer Science Homi Bhabha Road <br

Time: 

Friday, 23 April 2010 (All day)

Venue: 

We will see the definition of Probably Approximately CORRECT Learning. Then we will prove that its easy to learn about Rectangles and Conjunctions but hard to learn about 3-Term Disjunctions.

Contemporary Formal Mathematics (Part I)

Speaker: 

Benoit Razet Tata Institute of Fundamental Research School of Technology and Computer Science Homi Bhabha Road <br

Time: 

Friday, 26 March 2010 (All day)

Venue: 

Arithmetic is at the dawn of any scientific discipline. In our life we all have experienced (doing calculation) the validity of the following kind of equality 1947+1789 = 1789+1947 = 3736.

Is this Function Linear?

Speaker: 

Nutan Limaye School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road <br

Time: 

Friday, 5 February 2010 (All day)

Venue: 

Given a function as black box, where one can only query locations in the truth table of the function and each query will be charged, by querying only three locations one can tell whether the given function is linear or not with high probability.

Pages

Subscribe to RSS - Student Seminar