BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240402T100000
DTEND;TZID=Europe/Paris:20240402T110000
DTSTAMP:20260503T100734
CREATED:20240304T095916Z
LAST-MODIFIED:20240318T103700Z
UID:11450-1712052000-1712055600@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « How to rotate digital images without losing information? »\, Yukiko Kenmochi (GREYC\, Caen)
DESCRIPTION:While rotations are bijections that preserve distances and angles in Euclidean space\, these geometric properties are not preserved in general when rotations are applied to digital images. In this talk\, we particularlly focus on bijection and topology\, which are also generally lost. With regard to bijections\, we present the set of rotations that give bijective rotations in Z² and Z³. We also show the characterization of such rotations in Z². Turning to topology\, we present the class of 2D digital images whose topology is preserved under any rotation\, known as (digital) « regular » images\, along with « regularization » methods based on an up-sampling strategy. We also show that this notion of regularity cannot be extended to 3D since counter-examples exist.
URL:https://www.greyc.fr/event/seminaire-algorithmique-yukiko-kenmochi-greyc-caen/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240409T100000
DTEND;TZID=Europe/Paris:20240409T110000
DTSTAMP:20260503T100734
CREATED:20240304T100034Z
LAST-MODIFIED:20240318T103754Z
UID:11452-1712656800-1712660400@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Développement asymptotique complet pour les systèmes algébriques et au-delà »\, Olivier Bodini (LIPN\, Univ. Paris-Nord)
DESCRIPTION:Nous montrons dans cet exposé comment obtenir de manière algorithmique un développement asymptotique à tous les ordres pour les systèmes algébriques et donnons quelques clefs pour une généralisation pour certains systèmes différentiellement algébriques.
URL:https://www.greyc.fr/event/seminaire-algorithmique-olivier-bodini-lipn-univ-paris-nord/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20240416T100000
DTEND;TZID=Europe/Paris:20240416T110000
DTSTAMP:20260503T100734
CREATED:20240304T100149Z
LAST-MODIFIED:20240513T081701Z
UID:11454-1713261600-1713265200@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Domination in subcubic graphs: swapping numbers »\, Paul Dorbec (GREYC\, Caen)
DESCRIPTION:In 1996\, Bruce Reed worked on domination in cubic graphs\, and came to the conclusion that 1/3 of the vertices should suffice in dominating connected cubic graphs. Things are not that simple as there are some counter-examples\, but the problem still attracted attention (and gave birth to conjectures). In 2008\, Lowenstein and Rautenbach made a relatively short paper (almost 9 pages) proving that the bound holds for graphs with girth 83. After coming back on any graph theoretical concept necessary to understand the proof\, I will present how to swap this two numbers\, i.e. how to prove that the bound holds for graph of girth 9 in a 83 pages paper…
URL:https://www.greyc.fr/event/seminaire-algorithmique-antonin-reitz-inria-paris/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR