28vídeos
6hores
+ Segueix i comparteix
Segueix i comparteix aquesta llista de vídeosTancar
Playlist per web
Seguir per RSS
Copia i enganxa el codi al teu web o blog per incrustar la llista de reproducció:Amplada:px
Generar codi
Copia i enganxa la URL en el teu lector de notícies per seguir aquest Feed:Anar a la URL
Ordena
Filtra
Format
Matèria

Facultat de Matemàtiques i Informàtica (28)

MateFest InfoFest 2019
MateFest InfoFest 2019
matemàtiquesCatalà27 maig 2019338Celebració de la XX edició de la 'Matefest-Infofest'. Aquest és el nom de la festa organitzada pels estudiants de Matemàtiques i d'Enginyeria Informàtica de la Universitat de Barcelona que té com a objectiu apropar aquestes matèries als estudiants d'ESO i Batxillerat. Aquest esdeveniment té lloc a la mateixa Facultat de Matemàtiques i Informàtica de la Universitat l'11 d'abril de ...
Matefest Infofest 2018
Matefest Infofest 2018
matemàtiquesCatalà25 abr. 2018851Celebració de la XIX edició de la 'Matefest-Infofest'. Aquest és el nom de la festa organitzada pels estudiants de Matemàtiques i d'Enginyeria Informàtica de la Universitat de Barcelona que té com a objectiu apropar aquestes matèries als estudiants d'ESO i Batxillerat. Aquest esdeveniment té lloc a la mateixa Facultat de Matemàtiques i Informàtica de la Universitat el 18 d'abril de ...
Microscopic Description of Systems of Points with Coulomb-type Interactions
Microscopic Description of Systems of Points with Coulomb-type Interactions
matemàtiquesAnglès5 set. 2017426We are interested in systems of points with Coulomb, logarithmic or Riesz interactions (i.e. inverse powers of the distance). They arise in various settings: an instance is the study of Fekete points in approximation theory, another is the classical log gas or Coulomb gas which in some cases happens to be a random matrix ensemble, another is vortices in superconductors, superfluids or ...
Completely Positive Semidefinite Matrices: Conic Approximations and Matrix Factorization Ranks
Completely Positive Semidefinite Matrices: Conic Approximations and Matrix Factorization Ranks
matemàtiquesAnglès5 set. 2017430The completely positive semidefinite cone is a new matrix cone, which consists of all the symmetric matrices (of a given size) that admit a Gram factorization by positive semidefinite matrices of any size. This cone can thus be seen as a non-commutative analogue of the classical completely positive cone, replacing factorizations by nonnegative vectors (aka diagonal psd matrices) by arbitrary ...
Structure Tensors
Structure Tensors
matemàtiquesAnglès5 set. 2017457We show that in many instances, at the heart of a problem in numerical computation sits a special 3-tensor, the structure tensor of the problem that uniquely determines its underlying algebraic structure. For example, the Grothendieck constant, which plays an important role in unique games conjecture and SDP relaxations of NP-hard problems, arises as the spectral norm of such a structure ...
Fourier-like Bases and Integrable Probability
Fourier-like Bases and Integrable Probability
matemàtiquesAnglès5 set. 2017489No information.Presentation by: Alexei Borodin. MIT, USA
Information Complexity and Applications
Information Complexity and Applications
matemàtiquesAnglès5 set. 2017481Over the past two decades, information theory has reemerged within computational complexity theory as a mathematical tool for obtaining unconditional lower bounds in a number of models, including streaming algorithms, data structures, and communication complexity. Many of these applications can be systematized and extended via the study of information complexity – which treats information ...
Adaptive High-Order Methods for Elliptic Problems: Convergence and Optimality
Adaptive High-Order Methods for Elliptic Problems: Convergence and Optimality
matemàtiquesAnglès5 set. 2017437Adaptive algorithms for h-type finite element discretizations of elliptic problems are by now well understood, as far as their convergence and optimality properties are concerned.The design and analysis of adaptive algorithms for hp-type discretizations poses new challenges. Indeed, the choice between applying a mesh refinement or a polynomial enrichment is a delicate stage in the ...
Dynamic Formulation of Optimal Transportation and Variational Relaxation of Euler Equations
Dynamic Formulation of Optimal Transportation and Variational Relaxation of Euler Equations
matemàtiquesAnglès5 set. 2017470We will briefly recall the classical Optimal Transportation Framework and its Dynamic relaxations. We will show the link between these Dynamic formulation and the so-called Multi-Marginal extension of Optimal Transportation. We will then describe the so-called Iterative Proportional Fitting Procedure (IPFP aka Sinkhorn method) which can be efficiently applied to the multi-marginal OT setting. ...
Variational Discretizations of Gauge Field Theories Using Group-Equivariant Interpolation Spaces
Variational Discretizations of Gauge Field Theories Using Group-Equivariant Interpolation Spaces
matemàtiquesAnglès5 set. 2017484Variational integrators are geometric structure-preserving numerical methods that preserve the symplectic structure, satisfy a discrete Noether's theorem, and exhibit exhibit excellent long-time energy stability properties. An exact discrete Lagrangian arises from Jacobi's solution of the Hamilton-Jacobi equation, and it generates the exact flow of a Lagrangian system. By approximating the ...
T < 4E
T < 4E
matemàtiquesAnglès5 set. 2017469Descartes proved that a graph embedding into the plane on V vertices and E edges ...
Large Graph Limits of Learning Algorithms
Large Graph Limits of Learning Algorithms
matemàtiquesAnglès5 set. 2017459Many problems in machine learning require the classification of high dimensional data. One methodology to approach such problems is to construct a graph whose vertices are identified with data points, with edges weighted according to some measure of affinity between the data points. Algorithms such as spectral clustering, probit classification and the Bayesian level set method can all be ...
Pàgina