36 citations · 171 across the 32 of their papers we have counts for
36 papers
Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes
Christian Haase, Christoph Hertrich, Georg Loho
We prove that the set of functions representable by ReLU neural networks with integer weights strictly increases with the network depth while allowing arbitrary width. More precise…
Fine Polyhedral Adjunction Theory
Sofía Garzón Mora, Christian Haase
Originally introduced by Fine and Reid in the study of plurigenera of toric hypersurfaces, the Fine interior of a lattice polytope got recently into the focus of research. It is ha…
On the finite generation of valuation semigroups on toric surfaces
Klaus Altmann, Christian Haase, Alex Küronya +2
We provide a combinatorial criterion for the finite generation of a valuation semigroup associated with an ample divisor on a smooth toric surface and a non-toric valuation of maxi…
METL: a modern ETL pipeline with a dynamic mapping matrix
Christian Haase, Timo Röseler, Mattias Seidel
Modern ETL streaming pipelines extract data from various sources and forward it to multiple consumers, such as data warehouses (DW) and analytical systems that leverage machine lea…
Classifier construction in Boolean networks using algebraic methods
Robert Schwieger, Matías R. Bender, Heike Siebert +1
We investigate how classifiers for Boolean networks (BNs) can be constructed and modified under constraints. A typical constraint is to observe only states in attractors or even mo…
Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes
Marie-Charlotte Brandenburg, Christian Haase, Ngoc Mai Tran
We show that a competitive equilibrium always exists in combinatorial auctions with anonymous graphical valuations and pricing, using discrete geometry. This is an intuitive and ea…