Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar
*** on Thursday, April 20th, at 4:15 pm ***
at FEL CTU building
*** Karlovo nám. 13, Auditorium KN: E-107 ***
The talk is
Robert A. Vandermeulen: Inferring and Comparing the Concept Spaces of
Humans and Neural Networks
more information is available at https://www.praguecomputerscience.cz/
Kind regards,
Petra Milštainová
on behalf of organizers of Prague Computer Science Seminar
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1
Dear Colleagues,
let me to invite you to 123. Mathematical Colloquium - prof. William Cook
(on this Thursday 6.4.2023)
https://kam.mff.cuni.cz/~klazar/cook.pdf
____________________________________________________________________
123. kolokvium:
THE TRAVELING SALESMAN PROBLEM
W. Cook
ctvrtek 6. dubna 2023 ve 14:00, aula (refektar), prvni patro
MFF UK, Malostranske nam. 25, Praha 1
____________________________________________________________________
Abstract.
Is it possible to compute the shortest route through a large number
of stops? The task, known as the traveling salesman problem, or TSP
for short, sounds simple enough. And it arises in many practical
contexts, such as guiding a van to bring packages to your doorstep.
But even a whisper of the TSP strikes fear in the heart of the computing
world. A Washington Post article reported it would take "1,000 years to
compute the most efficient route between 22 cities." Claims such as this,
however, ignore 70 years of intense study. A 22-city TSP can be handled in
a snap with modern methods, even on an iPhone. Going larger, we describe
techniques that have been used to find to precise optimality the shortest
walk to 49,687 pubs in the UK. Or if you need to visit the nearest 2,079,471
stars, there is a route, ready to go, that is guaranteed to be no more than
1.0000074 times longer than a shortest possible tour.
The general setting is the following. Complexity theory suggests there are
limits to the power of general-purpose computational techniques, in
engineering,
science and elsewhere. But what are these limits and how widely do they
constrain our quest for knowledge? The TSP can play a crucial role in this
discussion, demonstrating whether or not focused efforts on a single,
possibly
unsolvable, model will produce results beyond our expectations.
We will discuss the history of the TSP and its applications, together with
computational efforts towards exact and approximate solutions.
[Apologies for multiple copies]
*** Czech Gathering of Logicians ***
Ostrava, June 1-2, 2023
https://irafm.osu.cz/CGL2023/
Czech Gathering of Logicians is an annual event that brings
together researchers in all areas of logic. While the event
is mainly aimed at logicians based in the Czech Republic,
researchers from other countries are warmly welcome as well.
The conference language is English.
This year's Gathering is organized by the University of Ostrava,
Institute for Research and Applications of Fuzzy Modeling.
== Important dates ==
Abstract submission deadline: April 11, 2023 (24:00 UTC)
Notification of acceptance: April 27, 2023
Early registration deadline: May 12, 2023
Late registration deadline: May 25, 2023
Recommended arrival: May 31, 2023
Conference: June 1-2, 2023
== Submission of abstracts ==
Researchers working in a field relevant to the conference
are encouraged to submit an abstract of 1-2 pages, including
references. New and recent research work is welcome for
presentation.
The authors should prepare their abstracts using the EasyChair
LaTeX style, available at
https://easychair.org/publications/for_authors.
The abstracts should be submitted in PDF via EasyChair,
at https://easychair.org/conferences/?conf=cgl2023.
The submission deadline is ** April 11, 2023 (24:00 UTC) **
All submissions will be evaluated by the programme committee.
Accepted submissions will be presented at the meeting in 30-minute
talks, including discussion. The conference language is English,
both for submission and for presentation.
== Programme ==
The conference programme will start on Thursday, June 1
around 9am and will conclude on Friday, June 2 around 3pm.
The recommended arrival day is Wednesday, May 31.
Invited speakers: to be announced
Programme committee:
- Libor Běhounek (University of Ostrava, chair)
- Martina Číhalová (Palacký University Olomouc)
- Antonín Dvořák (University of Ostrava)
- Zuzana Haniková (Czech Academy of Sciences)
- Rostislav Horčík (Czech Technical University)
- Emil Jeřábek (Czech Academy of Sciences)
- Vojtěch Kolman (Charles University in Prague)
- Jan Paseka (Masaryk University Brno)
- Vít Punčochář (Czech Academy of Sciences)
== Registration ==
The registration form can be found at
https://irafm.osu.cz/CGL2023/participation.html
Early conference fee (paid by bank transfer till May 12):
regular 2000 CZK, student 400 CZK
Late conference fee (paid after May 12):
regular 2500 CZK, student 500 CZK
The registration fee covers admission to the conference,
conference materials, coffee breaks, and social dinner.
Payment details for a bank transfer are given at
https://irafm.osu.cz/CGL2023/participation.html
Onsite payment is available on request.
Registration is open till May 25, 2023 (24:00 UTC).
== Venue ==
The conference will take place at the Univerity of Ostrava,
Building B (Ceskobratrska street 16, Ostrava):
https://irafm.osu.cz/CGL2023/venue.html
== Contact ==
Contact person: Martina Dankova (OC chair)
Office phone: +420 553 46 1410
Conference email: cglkonference(a)gmail.com
More details can be found on the conference website,
https://irafm.osu.cz/CGL2023/
Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar
*** on this Thursday, March 9th, at 4:15 pm ***
at MFF UK building
*** Malostranské náměstí 25, Lecture room S5 ***
The talk is
Tomáš Pevný: Steganography
more information is available at https://www.praguecomputerscience.cz/
Kind regards,
Petra Milštainová
on behalf of organizers of Prague Computer Science Seminar
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1
Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar
*** on Thursday, March 9th, at 4:15 pm ***
at MFF UK building
*** Malostranské náměstí 25, Lecture room S5 ***
The talk is
Tomáš Pevný: Steganography
more information is available at https://www.praguecomputerscience.cz/
Kind regards,
Petra Milštainová
on behalf of organizers of Prague Computer Science Seminar
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1
Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar
*** on Thursday, February 9th, at 4:15 pm ***
at FEL CTU building
*** Karlovo nám. 13, Auditorium KN: E-107 ***
The talk is
Ondřej Dušek: Robust Data-to-Text Generation with Pretrained Language
Models
more information is available at https://www.praguecomputerscience.cz/
Kind regards,
Petra Milštainová
on behalf of organizers of Prague Computer Science Seminar
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1
Dear Colleagues,
let me to invite you to 122. Mathematical Colloquium - prof. Alexander
Scott
(on this Thursday 2.2.2023)
____________________________________________________________________
122. kolokvium:
GRAPHS OF LARGE CHROMATIC NUMBER
A. D. Scott
ctvrtek 2. unora 2023 ve 14:00, aula (refektar), prvni patro
MFF UK, Malostranske nam. 25, Praha 1
____________________________________________________________________
Abstract.
The chromatic number has been a~fundamental topic of study in graph theory
for more than 150 years. Graph colouring has a~deep combinatorial theory
and, as with
many NP-hard problems, is of interest in both mathematics and computer
science. An
important challenge is to understand graphs with very large chromatic
number. The
chromatic number tells us something global about the structure of a
graph: if $G$ has
small chromatic number then it can be partitioned into a~few very simple
pieces. But
what if $G$ has large chromatic number? Is there anything that we can
say about its
local structure? In particular, are there particular substructures that
it must
contain? In this talk, we will discuss recent progress and open problems
in this area.
________________________________________________________________________
(pdf pozvanky: https://kam.mff.cuni.cz/~klazar/scott.pdf)
Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar
*** on Thursday, February 9th, at 4:15 pm ***
at FEL CTU building
*** Karlovo nám. 13, Auditorium KN: E-107 ***
The talk is
Ondřej Dušek: Robust Data-to-Text Generation with Pretrained Language
Models
more information is available at https://www.praguecomputerscience.cz/
Kind regards,
Petra Milštainová
on behalf of organizers of Prague Computer Science Seminar
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1
Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar
*** on this Thursday, January 12th, at 4:15 pm ***
at MFF UK building
*** Malostranské náměstí 25, Lecture room S5 ***
The talk is
Pavel Ircing & Jan Švec: Searching Large Audiovisual Archives
more information is available at https://www.praguecomputerscience.cz/
Kind regards,
Petra Milštainová
on behalf of organizers of Prague Computer Science Seminar
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1
Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar -
first in new year 2023
*** on Thursday, January 12th, at 4:15 pm ***
at MFF UK building
*** Malostranské náměstí 25, Lecture room S5 ***
The talk is
Pavel Ircing & Jan Švec: Searching Large Audiovisual Archives
more information is available at https://www.praguecomputerscience.cz/
Kind regards,
Petra Milštainová
on behalf of organizers of Prague Computer Science Seminar
--
Petra Milštainová
tel: +420 951 554 324
Univerzita Karlova
Matematicko-fyzikání fakulta UK
Informatický ústav Univerzity Karlovy
Malostranské nám. 25
118 00 Praha 1