output
20072025
most citedDeep Ordinal Regression Network for Monocular Depth Estimation

172 citations

Showing 2019Show all

6 papers · 1 filter

cs.CC2019★ 1 cited

Hardness of Minimum Barrier Shrinkage and Minimum Installation Path

Sergio Cabello, Éric Colin de Verdière

In the Minimum Installation Path problem, we are given a graph with edge weights and two vertices of . We want to assign a non-negative power to each ver…

math.CO2019★ 10 cited

Compacted binary trees admit a stretched exponential

Andrew Elvey Price, Wenjie Fang, Michael Wallner

A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that…

math.CA2019★ 6 cited

Absolute root separation

Yann Bugeaud, Andrej Dujella, Wenjie Fang +2

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be…

cs.LG2019★ 10 cited

Ultrametric Fitting by Gradient Descent

Giovanni Chierchia, Benjamin Perret

We study the problem of fitting an ultrametric distance to a dissimilarity graph in the context of hierarchical cluster analysis. Standard hierarchical clustering methods are speci…

math.CO2019★ 7 cited

The Steep-Bounce Zeta Map in Parabolic Cataland

Cesar Ceballos, Wenjie Fang, Henri Mühle

As a classical object, the Tamari lattice has many generalizations, including -Tamari lattices and parabolic Tamari lattices. In this article, we unify these generalizations in…

math.CO2019★ 7 cited

Tree series and pattern avoidance in syntax trees

Samuele Giraudo

A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. W…