Colloquium

Topoalgebra

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: 

20th century logic has founded mathematics on the binary relation of set membership, formalized with the axioms of Zermelo and Fraenkel.

Formal Definitions and Complexity Results for Trust Relations and Trust Domains

Speaker: 

Simon Kramer University of Luxembourg Interdisciplinary Centre for Security and Trust Campus Kirchberg, F103

Time: 

Tuesday, 1 February 2011 (All day)

Venue: 

We propose computational, declarative definitions of the concepts of weak and strong trust relations between interacting agents, and trust domains of trust-related agents in distributed systems.

Effective Eilenberg Machines

Speaker: 

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

Time: 

Wednesday, 17 March 2010 (All day)

Venue: 

In this talk I revisit the idea of Eilenberg (from the book Automata, Languages and machines Vol.A 1974) to use automata labelled with relations as a general computational model. The model is now called Eilenberg machines.

Encapsulating Quantification in the Typed Variables

Speaker: 

Amba Kulkarni University of Hyderabad Department of Sanskrit Studies P.O. Central University Hyderabad 500046

Time: 

Tuesday, 2 February 2010 (All day)

Venue: 

The asymmetry in the translation of Natural language sentences involving existential and universal quantifiers is well known. It is possible to get rid of this asymmetry by postulating 'quantified typed' variables.

Parallel Assembly of Large Genomes From Paired Short Reads

Speaker: 

Srinivas Aluru Ross Martin Mehl and Marylyne Munas Mehl Professor of Computer Engineering Department of Electrical and

Time: 

Monday, 26 October 2009 (All day)

Venue: 

High-throughput short read DNA sequencers are enabling inexpensive sampling of genomes at high coverage. Assembling such short reads to discover hitherto unsequenced organisms is an important challenge in computational biology.

Pages

Subscribe to RSS - Colloquium