3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.LG2024★ 1 cited
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles
Fan Yang, Pierre Le Bodic, Michael Kamp +1
Gradient boosting of prediction rules is an efficient approach to learn potentially interpretable yet accurate probabilistic models. However, actual interpretability requires to li…
cs.CG2022★ 3 cited
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema +2
The Euclidean shortest path problem (ESPP) is a well studied problem with many practical applications. Recently a new efficient online approach to this problem, RayScan, has been d…
cs.CC2016★ 1 cited
A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem
Cédric Bentz, Pierre Le Bodic
Pruhs and Woeginger prove the existence of FPTAS's for a general class of minimization and maximization subset selection problems. Without losing generality from the original frame…