Doowon Koh (고두원), Mattila-Sjölin type functions: A finite field model
Room B232 IBS (기초과학연구원)Let
10 events found.
Seminars and Colloquiums
Adam Zsolt Wagner, Constructions in combinatorics via neural networks
Zoom ID: 869 4632 6610 (ibsdimag)Recently, significant progress has been made in the area of machine learning algorithms, and they have quickly become some of the most exciting tools in a scientist’s toolbox. In particular, recent advances in the field of reinforcement learning have led computers to reach superhuman level play in Atari games and Go, purely through self-play. In …
O-joung Kwon (권오정), Classes of intersection digraphs with good algorithmic properties
Zoom ID: 875 9395 3555 (relay) [CLOSED]An intersection digraph is a digraph where every vertex
Alan Lew, Representability and boxicity of simplicial complexes
Zoom ID: 869 4632 6610 (ibsdimag)An interval graph is the intersection graph of a family of intervals in the real line. Motivated by problems in ecology, Roberts defined the boxicity of a graph G to be the minimal k such that G can be written as the intersection of k interval graphs. A natural higher-dimensional generalization of interval graphs is …
Hongseok Yang (양홍석), DAG-symmetries and Symmetry-Preserving Neural Networks
Room B232 IBS (기초과학연구원)The preservation of symmetry is one of the key tools for designing data-efficient neural networks. A representative example is convolutional neural networks (CNNs); they preserve translation symmetries, and this symmetry preservation is often attributed to their success in real-world applications. In the machine-learning community, there is a growing body of work that explores a new …
Jeong Ok Choi (최정옥), Invertibility of circulant matrices of arbitrary size
Room B232 IBS (기초과학연구원)In this talk, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations in terms of the entries in the first row with integer coefficients. Using these conditions we show the invertibility of some family of circulant matrices with particular forms of …
Florian Gut and Attila Joó, Large vertex-flames in uncountable digraphs
Zoom ID: 869 4632 6610 (ibsdimag)The local connectivity
Suil O (오수일), Eigenvalues and [a, b]-factors in regular graphs
Room B232 IBS (기초과학연구원)For positive integers,
Jaehoon Kim (김재훈),
Room B232
IBS (기초과학연구원)
For a graph
Stefan Weltge, Integer programs with bounded subdeterminants and two nonzeros per row
Room B232 IBS (기초과학연구원)We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries in each row. The core of our approach is the first polynomial-time algorithm for the weighted stable set problem on graphs that do not contain …