Publisher
Springer International Publishing
Reference28 articles.
1. Lecture Notes in Computer Science;PK Agarwal,2010
2. Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2(1–4), 195–208 (1987).
https://doi.org/10.1007/bf01840359
3. Bach, F.: Efficient algorithms for non-convex isotonic regression through submodular optimization. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 31, pp. 1–10. Curran Associates, Inc. (2018)
4. Balázs, G.: Convex Regression: Theory, Practice, and Applications. Ph.D. thesis (2016).
https://doi.org/10.7939/R3T43J98B
5. Chazelle, B.: A theorem on polygon cutting with applications. In: Symposium on Foundations of Computer Science (SFCS), pp. 339–349. IEEE (1982).
https://doi.org/10.1109/SFCS.1982.58