Seminar

Resource Constrained Signal Processing Algorithms and Architectures: A Holistic Approach

Speaker: 

Amit Acharyya University of Southampton School of Electronics and Computer Science SO17 1BJ United Kingdom<br

Time: 

Friday, 11 February 2011 (All day)

Venue: 

Current emerging applications in the areas of Wireless sensor networks, person-centric remote health monitoring and pervasive computing require sophisticated signal processing algorithms and their corresponding architectural implementation with lo

Globus Online: Hosted Service for High-speed, Reliable and Secure Data Movement

Speaker: 

Rajkumar Kettimuthu Argonne National Laboratory Maths and Computer Science Division 9700 South Cass Avenue Bu

Time: 

Thursday, 31 March 2011 (All day)

Venue: 

Grid computing enables scientists to combine and share the computer resources from multiple administrative domains to solve complex scientific problems.

Non-euclidean Algebra

Speaker: 

Vaughan Pratt Stanford University Computer Science Department 2215 Old Page Mill Road Palo Alto, CA 94304 <b

Time: 

Monday, 14 February 2011 (All day)

Venue: 

Euclidean geometry today is most naturally understood as affine geometry equipped with a suitable bilinearity as a basis for notions of length, angle, area, rectangles, circles, etc.

DIY Climate Change

Speaker: 

Vaughan Pratt Stanford University Computer Science Department 2215 Old Page Mill Road Palo Alto, CA 94304 <b

Time: 

Tuesday, 15 February 2011 (All day)

Venue: 

Climate skeptics today treat climate science and policies derived therefrom as a global conspiracy with the goal of fleecing the non-conspirators, namely the skeptics. The basic objection to the conspiracy is that it is founded on false science.

A Unified Framework for Testing Linear-Invariant Properties

Speaker: 

Arnab Bhattacharya Massachusetts Institute of Technology 32 Vassar St., Room G696 Cambridge, MA 02139 United

Time: 

Monday, 31 January 2011 (All day)

Venue: 

In a sequence of recent papers, Sudan and coauthors have investigated the relation between testability of properties of Boolean functions and the invariance of the properties with respect to transformations of the domain.

On Voting Machine Design for Verification and Testability

Speaker: 

Sanjit Seshia University of California, Berkeley Department of Electrical Engineering & Computer Sciences 253 Cory

Time: 

Tuesday, 28 December 2010 (All day)

Venue: 

I will present an approach for the design and analysis of an electronic voting machine based on a novel combination of formal verification and systematic testing by humans. The system was designed specifically to enable verification and testing.

Pages

Subscribe to RSS - Seminar