LINGUIST List 20.1721
|
Mon May 04 2009
Calls: Computational Linguistics/Greece
Editor for this issue: Elyssa Winzeler
<elyssa linguistlist.org>
|
LINGUIST is pleased to announce the launch of an exciting new feature: Easy Abstracts! Easy Abs is a free abstract submission and review facility designed to help conference organizers and reviewers accept and process abstracts online. Just go to: http://www.linguistlist.org/confcustom, and begin your conference customization process today! With Easy Abstracts, submission and review will be as easy as 1-2-3!
|
Directory
1. Barry
Cooper,
Developments in Computational Models
Message 1: Developments in Computational Models
|
Date: 04-May-2009
From: Barry Cooper <pmt6sbc leeds.ac.uk>
Subject: Developments in Computational Models
E-mail this message to a friend
Full Title: Developments in Computational Models Short Title: DCM 2009 Date: 11-Jul-2009 - 11-Jul-2009 Location: Rhodes, Greece Contact Person: Barry Cooper Meeting Email: pmt6sbc leeds.ac.uk Web Site: http://www.pps.jussieu.fr/~danos/dcm09 Linguistic Field(s): Computational Linguistics Call Deadline: 07-May-2009 Meeting Description: DCM 2009 is the fifth in a series of international workshops focusing on new computational models. It aims to bring together researchers who are currently developing new computational models or new features of a traditional one, to foster interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area. DCM 2009 will be a one-day satellite event of ICALP 2009, with a special focus on the theme 'Computational Models From Nature'. Plenary Speakers: Prakash Panangaden (McGill University) 'Computing with Anyons' Amin Coja-Oghlan (Edinburgh) 'Random Constraint Satisfaction Problems' Damien Woods (Seville) 'Two Notions of Uniformity in Natural Computing' Topics of interest include all abstract models of computation and their properties, and their applications to the development of programming languages and systems: - Quantum computation, including implementations and formal methods in quantum protocols - Probabilistic computation and verification in modeling situations; - Chemical, biological and bio-inspired computation, including spatial models, self-assembly, growth models - General concurrent models including the treatment of mobility, trust, and security - Information-theoretic ideas in computing Programme Committee: - S. Barry Cooper (Leeds, Co-chair) - Vincent Danos (Edinburgh, Co-chair) - Paola Bonizzoni (Milan) - Alessandra Carbone (Paris) - Luca Cardelli (Microsoft Research) - Robert Coecke (Oxford) - Mariangiola Dezani (Turin) - Ellie D'Hondt (Brussels) - Lionel Dupuy (SCRI, Dundee) - Jerome Feret (INRIA, ENS Paris) - Maribel Fernandez (King's College, London) - Mark Hogarth (Cambridge) - Jean-Pierre Jouannaud (Tsinghua, CNRS) - Zoran Konkoli (Chalmers) - Angsheng Li (CAS, Beijing) - Ian Mackie (Ecole Polytechnique) - Gheorghe Paun (Bucharest) - Simon Perdrix (Paris) - Grzegorz Rozenberg (Leiden) - Peter Selinger (Dalhousie) - Jiri Wiedermann (Prague) - Damien Woods (Seville) Call for Papers Deadline extended to 7 May 2009 Please submit an extended abstract (of around 10 pages or less) in pdf format to the conference EasyChair submission page: https://www.easychair.org/login.cgi?conf=dcm2009 Accepted contributions will appear in a special issue of the EPTCS (Electronic Proceedings in Theoretical Computer Science). After the workshop, full versions of selected papers will be considered for a special issue of the IJSI (International Journal of Software and Informatics). Important Dates: Submission deadline: 7 May, 2009 Notification: 25 May 2009 Workshop: 11 July, 2009 For further information contact: Barry Cooper, pmt6sbc leeds.ac.uk, or Vincent Danos, vincent.danos gmail.com
Read more issues|LINGUIST home page|Top of issue
|
|

Please report any bad links or misclassified data
LINGUIST Homepage | Read
LINGUIST | Contact us

While the LINGUIST List makes every effort to ensure the linguistic relevance of sites listed on its pages, it cannot vouch for their contents.
|
|