Dear all,
This week we begin this semester's noon seminar series. Our first
speaker on Thursday 24 Feb is Tomas Juškevičius (Czech Academy of
Sciences). Please find the title and abstract attached below.
For more information on the upcoming noon lectures, please visit
https://www.mff.cuni.cz/en/kam/teaching-and-seminars/noon-lectures
With best regards,
Misha.
--------------------------------------
Anticoncentration of sums of random vectors: on conjectures of
Leader-Radcliffe and Lee Jones
Tomas Juškevičius
Czech Academy of Sciences
February 24, 2022, 12:20 in S6
Abstract
In this talk we shall address the topic anticoncentration inequalities
for sums of random vectors. In particular, we shall asymptotically
establish two conjectures: one by Lee Jones (1978) and another by
Leader-Radcliffe (1994). Perhaps surprisingly, the essential ingredient
to establish the latter result is the Strong Perfect Graph Theorem by
Chudnovsky, Robertson, Seymour and Thomas (2002). The talk is based on
recent joint work with V. Kurauskas (Vilnius University).
----------------------------------------
Buongiorno, questa mail non è più attiva. Prego inviare comunicati stampa, news e informazioni a info(a)lacostruzionedelgusto.it. Grazie Alessia Cipolla
Dear Colleagues,
we invite you to the next meeting of Prague Computer Science Seminar
*** on this 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,
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.