A-212 (STCS Seminar Room)

Complexity of Graphical Realizations of Linear Codes

Speaker: 

Navin Kashyap Queen's University Department of Mathematics and Statistics Kingston, Ontario Canada K7L 3N6<br

Time: 

Monday, 5 July 2010 (All day)

Venue: 

A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces and linear local constraint codes to be associated with the edges and vert

How to Generate a Large String almost Uniformly at Random, with a Small Number of Coin Tosses?

Speaker: 

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

Time: 

Friday, 28 May 2010 (All day)

Venue: 

Computer scientists devise randomized algorithms when they cannot find good deterministic ones. Then they try to decrease the randomness used and still try to prove that the algorithm answers correctly with high probability.

Communication in Subclasses of Petri Nets

Speaker: 

Kamal Lodaya Institute of Mathematical Sciences CIT Campus Tharamani Chennai 600 113 http://www.imsc.res.

Time: 

Friday, 28 May 2010 (All day)

Venue: 

Petri net theory has nice theorems which relate subclasses of Petri nets defined by structural conditions -- for example T-nets (also known as marked graphs) and free choice nets -- to their behavioural properties -- such as checking, given a net

Some Extentsions to the Theory of Regularity in Formal Languages

Speaker: 

Ajesh Babu School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road

Time: 

Friday, 25 June 2010 (All day)

Venue: 

In formal languguage theory, regularity is a robust notion having many equivalent representations: regular expressions, finite state automata, MSO etc. These have made important impact on programming and verification tools.

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.

A Near-tight Approximation Algorithm for the Robot Localization Problem

Speaker: 

Apurva Mudgal Indian Institute of Technology, Ropar Department of Computer Science and Engineering Nangal Roa

Time: 

Monday, 28 June 2010 (All day)

Venue: 

Localization is a fundamental problem in robotics. The kidnapped robot possesses a compass and map of its environment it must determine its location at a minimum cost of travel distance.

Pages

Subscribe to RSS - A-212 (STCS Seminar Room)