2.8k citations
- Max Planck SocietyDE261 papers
- Saarland UniversityDE124 papers
- Technische Universität BerlinDE55 papers
- Centre National de la Recherche ScientifiqueFR41 papers
- Korea UniversityKR41 papers
- Stanford UniversityUS25 papers
- Institut national de recherche en sciences et technologies du numériqueFR24 papers
- ETH ZurichCH21 papers
- Helmholtz Center for Information SecurityDE20 papers
- Technical University of MunichDE20 papers
- Université de LorraineFR17 papers
- University of LuxembourgLU16 papers
54 papers · 1 filter
Counting Triangulations and other Crossing-free Structures via Onion Layers
Victor Alvarez, Karl Bringmann, Radu Curticapean +1
Let be a set of points in the plane. A crossing-free structure on is a plane graph with vertex set . Examples of crossing-free structures include triangulations of $…
Multi-View Priors for Learning Detectors from Sparse Viewpoint Data
Bojan Pepik, Michael Stark, Peter Gehler +1
While the majority of today's object class models provide only 2D bounding boxes, far richer output hypotheses are desirable including viewpoint, fine-grained category, and 3D geom…
Estimation of Human Body Shape and Posture Under Clothing
Stefanie Wuhrer, Leonid Pishchulin, Alan Brunton +2
Estimating the body shape and posture of a dressed human subject in motion represented as a sequence of (possibly incomplete) 3D meshes is important for virtual change rooms and se…
A Combinatorial -time Algorithm for the Min-Cost Flow Problem
Ruben Becker, Andreas Karrenbauer
We present a combinatorial method for the min-cost flow problem and prove that its expected running time is bounded by . This matches the best known bounds, whic…
Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply
Khaled Elbassioni, Mahmoud Fouz, Chaitanya Swamy
We consider {\em profit-maximization} problems for {\em combinatorial auctions} with {\em non-single minded valuation functions} and {\em limited supply}. We obtain fairly general…
On the Geometric Ramsey Number of Outerplanar Graphs
Josef Cibulka, Pu Gao, Marek Krčál +2
We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey num…