## Speaker:

## Time:

## 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.

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

Monday, 28 June 2010 (All day)

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.

Rahul Roy
Indian Statistical Institute
Stat. Math. Unit
7, S.J.S. Sansanwal Marg
New Delhi 110016
http://

Monday, 21 June 2010 (All day)

Rahul Jain
University of Southern California
Viterbi School of Engineering, EEB-328
Los Angeles, CA 90089-256
<br/

Friday, 21 May 2010 (All day)

The scarcity of spectrum is becoming an impediment to the growth of more capable wireless networks.

Rajmohan Rajaraman
Northeastern University
College of Computer & Information Science
Boston, MA 02115
United

Thursday, 20 May 2010 (All day)

In a landmark paper, Papadimitriou introduced several syntactic subclasses of the search class TFNP (Total Function Nondeterministic Polynomial) based on proof styles that (unlike TFNP) admit complete problems.

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

Friday, 14 May 2010 (All day)

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.

Sumeet Sandhu
Intel Corporation
2200 Mission College Blvd.
Santa Clara
California 95054-1549
United Stat

Monday, 17 May 2010 (All day)

We will present a broad range of longer-term research at Intel Labs, ranging from sensing/perception to networking to exascale computing.

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

Friday, 30 April 2010 (All day)

An under-determined system of linear equation has infinitely many solutions (if it has a solution).

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

Friday, 23 April 2010 (All day)

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.

Vinod Prabhakaran
University of Illinois at Urbana-Champaign
123 Coordinated Science Laboratory
Urbana, IL 61801

Tuesday, 20 April 2010 (All day)

In a short span in the 1940's Claude Shannon established the fields of information theory and modern cryptography which lie at the foundation of the digital era.

Joydeep Dutta
Indian Institute of Technology
Department of Mathematics and Statistics
Kanpur 208016
http://www

Monday, 19 April 2010 (All day)