Vés al contingut (premeu Retorn)

Resultats de la cerca

1222 elements coincideixen amb el vostre criteri de cerca. Ordena per rellevància · data (més recent primer) · alfabèticament
Filtra els resultats.
Computational geometry seminar: Christian Rubio-Montiel
Title: The diachromatic number and its homomorphisms Speaker: Christian Rubio-Montiel Comenius University in Bratislava Abstract: We will introduce the diachromatic number, which is a generalization of the achromatic number, and the concept of dihomomorphism. We will prove an interpolation theorem and some relations type Nordhaus-Gaddum.
Ubicat a Activitats
Computational geometry seminars: J. Pfeifle
The simplexity of a convex d-polytope P with n vertices is the minimum number of simplices necessary to triangulate P without using new vertices. In dimension 3 and above, bounds for the simplexity are scarce, even in such well-studied cases as the d-dimensional cube. One general method for obtaining bounds on the simplexity is doing linear optimization over the universal polytope U(P). However, since U(P) lives in (d+1)-dimensional space, these linear programs quickly become infeasible computationally. On the other hand, if P is symmetric, we can use techniques from the representation theory of finite groups to simplify the computations. In the Tuesday session, we'll give a crash course on the basics of representation theory, and apply these tools to the problem at hand on Friday.
Ubicat a Activitats
Computational geometry seminar: Mercè Mora
COMPUTATIONAL GEOMETRY SEMINAR Thursday, April 28, 2016, 13:15-14:15 (15 minutes delayed with respect to the usual schedule) - Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2) Title: Graphs, hypergraphs and dominating sets Speaker: Mercè Mora Universitat Politècnica de Catalunya
Ubicat a Activitats
Computational geometry seminar: Computing the L1 Geodesic Diameter and Center of a Polygonal Domain
Ubicat a Activitats
Computational Geometry Seminar: Canek Peláez
Two Computational Geometry Seminars
Ubicat a Activitats
Computational Geometry Seminar: Large empty convex holes in random point sets
Computational Geometry Seminar: Large empty convex holes in random point sets de Octavio Arizmendi (CIMAT, Guanajuato, México).
Ubicat a Activitats
Computational Geometry Seminar: Convex quadrangulations of bichromatic point sets
Computational Geometry Seminar: Convex quadrangulations of bichromatic point sets de Carlos Seara (Universitat Politècnica de Catalunya). Dijous 18 de maig a les 12:15.
Ubicat a Activitats
Computational geometry seminar: Carlos Seara
Ubicat a Activitats
Computational Geometry Seminar. Clemens Huemer : The degree/diameter problem in maximal planar bipartite graphs.
Friday, December 4, 2015, 12:30-13:30 (15 minutes delayed with respect to the usual schedule) Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)
Ubicat a Activitats
Computational Geometry Seminar: Franz Aurenhammer
Two Computational Geometry Seminars
Ubicat a Activitats