BEGIN:VCALENDAR
METHOD:PUBLISH
VERSION:2.0
X-WR-CALNAME:DGCI 2011
PRODID:-//Apple Inc.//iCal 4.0.4//EN
X-APPLE-CALENDAR-COLOR:#2CA10B
X-WR-TIMEZONE:Europe/Paris
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
DTSTART:19810329T020000
TZNAME:GMT+02:00
TZOFFSETTO:+0200
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
DTSTART:19961027T030000
TZNAME:GMT+01:00
TZOFFSETTO:+0100
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:2D8A4495-72F5-4291-A5CF-2AE957497EC3
DTEND:20080416T160000Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
UID:E5A54B76-789C-4164-9D9C-2BACA99EF7D0
DTEND:20080416T160000Z
TRANSP:OPAQUE
SUMMARY:Poster and Demo Session
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223235Z
UID:E8C320A0-9728-4558-BD24-27863B4760D2
DTEND:20110408T135500Z
TRANSP:OPAQUE
SUMMARY:Farewell and Coffee Break
DTSTART:20110408T135500Z
DTSTAMP:20110131T223734Z
SEQUENCE:4
END:VEVENT
BEGIN:VEVENT
UID:529B7B27-F27A-4543-A75B-6306CC9D0C4B
DTEND:20080416T160000Z
TRANSP:OPAQUE
SUMMARY:Guided Visit of Nancy
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224738Z
UID:4E84A8AF-8925-4E3B-B211-DE0975C87E78
DTEND:20110406T173000Z
TRANSP:OPAQUE
SUMMARY:Guided Visit of Nancy
DTSTART:20110406T160000Z
DTSTAMP:20110131T224944Z
SEQUENCE:2
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:CFECC966-79EE-46A8-874E-3579F65EF1C8
DTEND:20110407T104500Z
TRANSP:OPAQUE
SUMMARY:Tomography (Session dedicated to Alain Daurat)  (Session Chair: M. Tajine) 
DTSTART:20110407T092500Z
DTSTAMP:20110131T224027Z
SEQUENCE:4
DESCRIPTION:* Bounds on the difference between reconstructions in binary
  tomography (11:30)\nKees Joost Batenburg\, Wagner Fortes\, Lajos Hajdu\
 , Robert Tijdeman\n\n* Characterization of {-1\,0\,+1} valued functions 
 in discrete tomography under sets of four directions (11:55)\nSara Brune
 tti\, Paolo Dulio\, Carla Peri\n\n* Growth of projection ghosts created 
 by iteration (12:20)\nImants Svalbe\, Shekhar Chandra\n\n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:F00E107E-98FC-4073-8F34-8412BF6EE7DB
DTEND:20110407T154500Z
TRANSP:OPAQUE
SUMMARY:Poster and Demo Session
DTSTART:20110407T134500Z
DTSTAMP:20110131T224140Z
SEQUENCE:1
END:VEVENT
BEGIN:VEVENT
UID:2C3E6FB8-A0F7-420E-BCCC-061FD22C72D0
DTEND:20080416T160000Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:11050BBB-9D6A-413E-9075-D4C74C193F93
DTEND:20110407T190000Z
TRANSP:OPAQUE
SUMMARY:Gala Diner (Salons de l'hotel de ville de Nancy)
DTSTART:20110407T173000Z
DTSTAMP:20110131T224203Z
SEQUENCE:2
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:6518DB6C-5ED8-424D-906E-EB44C5B29D3C
DTEND:20110407T085500Z
TRANSP:OPAQUE
SUMMARY:Discrete and Combinatorial Tools for Image Segmentation and Analysis (Session Chair: G. Borgefors) 
DTSTART:20110407T083000Z
DTSTAMP:20110131T223851Z
SEQUENCE:2
DESCRIPTION:* Smale-Like Decomposition and Forman Theory for Discrete Sc
 alar Fields (10:30)\nLidija Comic\, Mohammed Mostefa Mesmoudi\, Leila De
  Floriani\n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224624Z
UID:9FCC9896-BF2C-4248-8007-C86A9FB04BAF
DTEND:20110406T121500Z
TRANSP:OPAQUE
SUMMARY:Lunch Break
DTSTART:20110406T104500Z
DTSTAMP:20110131T224824Z
SEQUENCE:6
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224215Z
UID:138236CE-7D53-49E8-9DE1-3DF5BC810AA9
DTEND:20110406T081500Z
TRANSP:OPAQUE
SUMMARY:Invited Lecture: Jean Serra (Session Chair: C. Kiselman) 
DTSTART:20110406T071500Z
DTSTAMP:20110131T224611Z
SEQUENCE:6
DESCRIPTION:Hierarchical Segmentations\n\nAbstract:\nMost of the current
  segmentation techniques\, in image processing\, rest on hierarchies of 
 transforms. The final segmentation borrows its classes from the various 
 levels by minimizing energy\, or by reference to a connective criterion.
 \n\nThe efficiency of the approach depends on some conditions on the und
 erlying energy\, or connection. For example\, when energy satisfies the 
 condition of hierarchical increasingness\, then the partitions of minimu
 m energy can be characterized and computed easily. Moreover\, these solu
 tions form a complete lattice for the ordering of the partitions. Theref
 ore\, one can always take the (unique) largest solution\, or act on the 
 whole set of solutions according to some new criterion. A few examples i
 llustrate these points.\n\nOn the other hand\, these methods often gener
 ate small classes that still persist at the high levels of hierarchies. 
 The usual ordering on partitions\, namely that of refinement\, is probab
 ly too severe. It can A new ordering\, called building ordering\, is pro
 posed. It requires the datum of a connection over the space E to segment
 \, and states that $ A \\preccurlyeq B $ \, with $ A\,B \\subseteq E $\,
  when each connected component of B contains a connected component of A.
  The building ordering applies to sets\, to partitions\, and to numerica
 l functions.\n\nWhen it replaces the refinement ordering\, it then becom
 es possible to share the small parasite classes between their neighbours
 \, to create hierarchical semi-groups\, and to combine partitions for ob
 taining median ones. \n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224909Z
UID:CAC09A52-977A-4F37-99D0-E2FC45E08A26
DTEND:20110406T150000Z
TRANSP:OPAQUE
SUMMARY:Discrete Shape Representation\, Recognition and Analysis I (Session Chair: E. Andres) 
DTSTART:20110406T134500Z
DTSTAMP:20110131T224923Z
SEQUENCE:2
DESCRIPTION:\n* Distance between separating circles and points (15h45)\n
 Peter Veelaert\n\n* Delaunay properties of digital straight segments (16
 h10)\nTristan Roussillon\, Jacques-Olivier Lachaud\n\n* Estimation of th
 e derivatives of a digital function with a convergent bounded error (16h
 35)\nLaurent Provot\, Yan Gérard\n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223017Z
UID:3EE8E42F-234D-47D7-B424-F1EDD530A832
DTEND:20110408T085500Z
TRANSP:OPAQUE
SUMMARY:Geometric Transform (Session Chair: A. Montanvert) 
DTSTART:20110408T083000Z
DTSTAMP:20110131T223254Z
SEQUENCE:3
DESCRIPTION:Path-Based Distance with Varying Weights and Neighborhood Se
 quences\n \nNicolas Normand\, Robin Strand\, Pierre Evenou\, Aurore Arli
 cot \n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224624Z
UID:97361F7B-566F-47D3-85F2-A12D5D1FFEF2
DTEND:20110406T092900Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20110406T090500Z
DTSTAMP:20110131T230110Z
SEQUENCE:4
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223235Z
UID:9DF5FDF6-C7C5-4209-AC4A-F138D469E5FA
DTEND:20110408T092900Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20110408T085500Z
DTSTAMP:20110131T230216Z
SEQUENCE:3
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224237Z
UID:1D57E332-DBA0-490B-B45C-D1B674C80743
DTEND:20110406T070000Z
TRANSP:OPAQUE
SUMMARY:Registration
DTSTART:20110406T063000Z
DTSTAMP:20110131T224601Z
SEQUENCE:2
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224622Z
UID:8A3C59F1-E176-4877-8296-C2EDB34E34B1
DTEND:20110406T134400Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20110406T131500Z
DTSTAMP:20110131T230127Z
SEQUENCE:3
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T211134Z
UID:A7945971-98FA-4B02-8F14-DD738A3A4259
DTEND:20080416T181500Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20080416T160000Z
DTSTAMP:20110131T211149Z
SEQUENCE:1
END:VEVENT
BEGIN:VEVENT
UID:64300A5F-AE94-428B-AE3C-9D68DB46029B
DTEND:20080416T160000Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224047Z
UID:2DB02B9E-3DCF-40A4-9E26-2913A0AC4AEF
DTEND;TZID=Europe/Paris:20110407T151500
TRANSP:OPAQUE
SUMMARY:Fast Track 2 (Session Chair: B. Kerautret) 
DTSTART;TZID=Europe/Paris:20110407T141500
DTSTAMP:20110131T224124Z
SEQUENCE:5
DESCRIPTION:* Approximate Shortest Paths in Simple Polyhedra\nFajie Li\,
 Reinhard Klette\,Xiuxia Pan\n\n* Associating cell complexes to four dime
 nsional digital objects\nAna Pacheco\, Pedro Real\n\n* Completions and s
 implicial complexes\nGilles Bertrand\n\n* Hierarchic Euclidean skeletons
  in cubical complexes\nMichel Couprie\n\n* Image Denoising with a Constr
 ained Discrete Total Variation Scale Space\nIgor Ciril\, Jerome Darbon\n
 	\n* Measures for Surface Comparison on Unstructured Grids with Differen
 t Density\nNatalia Dyshkant\n\n* Properties of Minimal Ghosts\nImants Sv
 albe\, Nicolas Normand\n\n* Quasi-linear transformations, substitutions and fractals\nMarie-Andrée Jacob-Da Col\, Pierre Tellier\n\n* Tiling th
 e plane with permutations\nAlexandre Blondin Masse\, Andrea Frosini\, Si
 mone Rinaldi\, Laurent Vuillon\n\n* Selection of relevant nodes from com
 ponent-trees in linear time\nNicolas Passat\, Benoît Naegel 
END:VEVENT
BEGIN:VEVENT
UID:F9DB59FF-7758-4B8E-9C0E-58C8319BCE1A
DTEND:20080416T160000Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223235Z
UID:E6C54643-DCBF-48C3-95B5-CB2F844D8B04
DTEND:20110408T125000Z
TRANSP:OPAQUE
SUMMARY:Models for Discrete Geometry II 
DTSTART:20110408T120000Z
DTSTAMP:20110131T223525Z
SEQUENCE:2
DESCRIPTION:* An Arithmetic and Combinatorial Approach to three-dimensio
 nal Discrete Lines (14:15)\nValérie Berthé\, Sébastien Labbé\n\n* Toward
  a new définition for digital tangents (14:40)\nThierry Monteil\n\n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224422Z
UID:507CBE83-2BA5-48FE-B897-98C9513CB1DC
DTEND:20110406T090500Z
TRANSP:OPAQUE
SUMMARY:Morphological Analysis (Session Chair: C. Kiselman) 
DTSTART:20110406T081500Z
DTSTAMP:20110131T224613Z
SEQUENCE:3
DESCRIPTION:Description\n\n* Some Morphological Operators on Simplicial 
 Complex Spaces (10:15)\nFábio Dias\, Jean Cousty\, Laurent Najman\n\n*Ma
 thematical Morphology on Hypergraphs: Preliminary Definitions and Result
 s (10:40)\nIsabelle Bloch\, Alain Bretto 
END:VEVENT
BEGIN:VEVENT
UID:C6068DB7-D1E0-4494-BFEE-8AA88CAA151E
DTEND:20080416T153000Z
TRANSP:OPAQUE
SUMMARY:Reception - Evening Buffet
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T154901Z
UID:F2471FD2-7A24-4365-9147-155A89338456
DTEND;TZID=Europe/Paris:20110104T010000
TRANSP:OPAQUE
SUMMARY:dsjklqjfld
DTSTART;TZID=Europe/Paris:20110104T000000
DTSTAMP:20110131T154902Z
SEQUENCE:2
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:C3B08B14-C238-4646-BB9F-00F701520AAE
DTEND:20110407T121500Z
TRANSP:OPAQUE
SUMMARY:TC 18 Meeting (optional)
DTSTART:20110407T113500Z
DTSTAMP:20110131T224146Z
SEQUENCE:1
END:VEVENT
BEGIN:VEVENT
UID:F5D22315-66E0-4988-91F3-9F7DC4D113FD
DTEND:20080416T153000Z
TRANSP:OPAQUE
SUMMARY:Farewell and Coffee Break
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
UID:199B70AD-D302-4678-BA99-1F6F0BC384EA
DTEND:20080416T153000Z
TRANSP:OPAQUE
SUMMARY:Fast Track 2 (5 minutes per poster) (Session Chair: B. Kerautret) 
DTSTART:20080416T143000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223031Z
UID:B6F15499-2278-4425-A27C-89F0694DE4CF
DTEND:20110408T083000Z
TRANSP:OPAQUE
SUMMARY:Invited Lecture: Agnès Desolneux (Session Chair: A. Montanvert) 
DTSTART:20110408T073000Z
DTSTAMP:20110131T223154Z
SEQUENCE:4
DESCRIPTION:Title: A probabilistic grouping principle to go from pixels 
 to visual \nstructures.\n\nAbstract:\nThis talk will describe how the He
 lmholtz principle\, which is a principle of visual perception\, can be t
 ranslated into a computational tool that can be used for many problems o
 f detection of a given structure in a discrete image. The Helmholtz prin
 ciple can be formulated two ways. The first way is common sensical. It s
 imply states that we do not perceive any structure in a uniform random i
 mage. In this form\, the principle was first stated by Attneave (1954). 
 In its stronger form\, of which we shall make great use\, the Helmholtz 
 principle states that whenever some large deviation from randomness occu
 rs\, a structure is perceived. In other words\, ``we immediately perceiv
 e whatever has a low likelihood of resulting from accidental arrangement
 '' (stated in Vision by S.-C. Zhu or D. Lowe). To translate this princip
 le into a computational tool\, we will introduce a variable called NFA (
 Number of False Alarms) associated to any geometric event in an image. T
 he NFA of an event is defined as the expectation of the number of occurr
 ences of this event in a pure noise image of same size. Meaningful event
 s will then be events with a very low NFA. We will see how this notion c
 an be efficiently used in many detection problems (alignements\, smooth 
 curves\, edges\, etc.). The common framework of these detection problems
  is that they can all be translated into the question of knowing whether
  a given group of pixels is meaningful or not. This is a joint work with
  Lionel Moisan and Jean-Michel Morel. 
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:7F6EF58E-B3AF-40D6-BEBF-7E5223FAAFBD
DTEND:20110407T121500Z
TRANSP:OPAQUE
SUMMARY:Lunch Break
DTSTART:20110407T104500Z
DTSTAMP:20110131T224034Z
SEQUENCE:1
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224738Z
UID:21288A69-915B-4ED4-93D9-CEFCEFF8A786
DTEND:20110406T131500Z
TRANSP:OPAQUE
SUMMARY:Fast Track 1 (5 minutes per poster) (Session Chair: E Domenjoud) 
DTSTART:20110406T121500Z
DTSTAMP:20110131T224855Z
SEQUENCE:2
DESCRIPTION:* ACCORD: With Approximate Covering of Convex Orthogonal Dec
 omposition\nMousumi Dutt\, Arindam Biswas\, Partha Bhowmick\n\n* Analyti
 cal Description of Digital Circles\nTristan Roussillon\, Eric Andres\n\n
 * A near-linear time guaranteed algorithm for digital curve simplificati
 on under the Fréchet distance\nI Sivignon\n\n* An error bounded tangent 
 estimator for digital curves\nDilip K.Prasad\, Maylor K.H. Leung\n\n* Ci
 rcular arc reconstruction of digital contours with chosen Hausdorff erro
 r\nBertrand Kerautret\, Jacques-Olivier Lachaud\, Thanh Phuong Nguyen\n	
 \n* Computing the Characteristics of a SubSegment of a Digital Straight 
 Line in Logarithmic Time\nMouhammad Said\, Jacques-Olivier Lachaud\n\n* 
 Efficient robust digital hyperplane fitting with bounded error\nDror Ai
 ger\, Yukiko Kenmochi\, Hugues Talbot\, Lilian Buzer\n\n* Introduction t
 o Digital Level Layers\nYan Gérard\, Laurent Provot\, Fabien Feschet\n\n
 * Optimal Consensus set for Annulus Fitting\nRita Zrour\, Gaëlle Largete
 au-Skapin\, Eric Andres\n\n* Properties and Applications of the Simplifi
 ed Generalized Perpendicular Bisector\nAurélie Richard\, Gaëlle Largete
 au-Skapin\, Marc Rodriguez\, Eric Andres\, Laurent Fuchs 
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223235Z
UID:61D1E217-0B9D-480E-82CF-E08B33300305
DTEND:20110408T134000Z
TRANSP:OPAQUE
SUMMARY:Discrete Shape Representation\, Recognition and Analysis II
DTSTART:20110408T125000Z
DTSTAMP:20110131T223704Z
SEQUENCE:4
DESCRIPTION:* Recursive Calculation of Relative Convex Hulls (15:05)\nGi
 sela Klette\n\n* Sparse Object Representations by Digital Distance Funct
 ions (15:30)\nRobin Strand\n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223235Z
UID:EE25183D-1B86-4C03-8F88-A700DB122F22
DTEND:20110408T120000Z
TRANSP:OPAQUE
SUMMARY:Lunch Break
DTSTART:20110408T104500Z
DTSTAMP:20110131T223456Z
SEQUENCE:1
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:28D5143E-7090-4299-A7A9-0D82763D16F1
DTEND:20110407T092400Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20110407T085500Z
DTSTAMP:20110131T230154Z
SEQUENCE:4
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:9D4B0295-7F2B-4C62-9DCD-2A395342B5A1
DTEND:20110407T083000Z
TRANSP:OPAQUE
SUMMARY:IAPR Invited Lecture: Jarek Rossignac (Session Chair: G. Borgefors) 
DTSTART:20110407T073000Z
DTSTAMP:20110131T223819Z
SEQUENCE:2
DESCRIPTION:\nTitle: Ball-based shape processing\n\nAbstract:\nWe discus
 s ball-based approaches for segmenting and for rounding digital models a
 nd also for measuring the discrepancy and for computing the corresponden
 ce and optimal morph between shapes. Papers describing these techniques 
 may be found on http://www.gvu.gatech.edu/~jarek/papers.html.\n
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224738Z
UID:66FA5A30-A8B7-43F0-ABE6-1425D937F536
DTEND:20110406T190000Z
TRANSP:OPAQUE
SUMMARY:Reception - Evening Buffet
DTSTART:20110406T173000Z
DTSTAMP:20110131T224953Z
SEQUENCE:2
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223235Z
UID:C53AB239-295A-473B-978E-A62E4537493D
DTEND:20110408T104500Z
TRANSP:OPAQUE
SUMMARY:Models for Discrete Geometry I (Session Chair: S. Brlek) 
DTSTART:20110408T093000Z
DTSTAMP:20110131T223449Z
SEQUENCE:2
DESCRIPTION:* Metric bases for polyhedral gauges (11:30)\nFabien Rebatel
 \, Edouard Thiel\n\n* An Improved Riemannian Metric Approximation for Gr
 aph Cuts (11:55)\nOndřej Daněk\, Pavel Matula\n\n* Smooth 2D coordinate 
 systems on discrete surfaces (12:20)\nColin Cartade\, Rémy Malgouyres\, 
 Christian Mercat\, Chafik Samir\n
END:VEVENT
BEGIN:VEVENT
UID:942A9179-E2E8-4BDE-81F1-7E3D8F37E7EC
DTEND:20080416T160000Z
TRANSP:OPAQUE
SUMMARY:TC 18 Meeting (optional)
DTSTART:20080416T153000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224237Z
UID:71299161-03B6-470E-B65D-5F28A814AF7F
DTEND:20110406T071400Z
TRANSP:OPAQUE
SUMMARY:Welcome Talk
DTSTART:20110406T070000Z
DTSTAMP:20110131T230011Z
SEQUENCE:5
END:VEVENT
BEGIN:VEVENT
UID:8777E6FA-56BA-47F6-9F48-819439C668E2
DTEND:20080416T153000Z
TRANSP:OPAQUE
SUMMARY:Fast Track 1 (5 minutes per poster) (Session Chair: E Domenjoud) 
DTSTART:20080416T143000Z
DTSTAMP:20110131T210944Z
SEQUENCE:0
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T223747Z
UID:418DE979-E10F-42F3-B457-6983700D8A68
DTEND:20110407T134400Z
TRANSP:OPAQUE
SUMMARY:Coffee Break
DTSTART:20110407T131500Z
DTSTAMP:20110131T230203Z
SEQUENCE:2
END:VEVENT
BEGIN:VEVENT
CREATED:20110131T224725Z
UID:0D7CF497-48EF-4F31-8EEA-66BE57E44CE3
DTEND;TZID=Europe/Paris:20110406T124500
TRANSP:OPAQUE
SUMMARY:Discrete and Combinatorial Topology (Session Chair: W. Kropatsch)  
DTSTART;TZID=Europe/Paris:20110406T113000
DTSTAMP:20110131T224827Z
SEQUENCE:5
DESCRIPTION:* A unified topological framework for digital imaging (11h30
 )\nLoïc Mazo\, Nicolas Passat\, Michel Couprie\, Christian Ronse\n\n* Is
 thmus-Based 6-Directional Parallel Thinning Algorithms (11h55)\nBenjamin
  Raynal\, Michel Couprie\n\n* Well-composed cell complexes (12h20)\nRoci
 o Gonzalez-Diaz\, Maria Jose Jimenez\, Belen Medrano\n
END:VEVENT
END:VCALENDAR
