Publisher
Springer International Publishing
Reference18 articles.
1. Avis, D., Rappaport, D.: Computing the largest empty convex subset of a set of points. In: Proceedings of the First Annual Symposium on Computational Geometry, SCG 1985, pp. 161–167. ACM, New York (1985). https://doi.org/10.1145/323233.323255
2. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-Price: column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998). https://doi.org/10.1287/opre.46.3.316
3. Benato, B.C., Telea, A.C., Falcão, A.X.: Semi-supervised learning with interactive label propagation guided by feature space projections. In: Proceedings of the 31st SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI), pp. 392–399, October 2018. https://doi.org/10.1109/SIBGRAPI.2018.00057
4. Benato, B.C., Gomes, J.F., Telea, A.C., Falcão, A.X.: Semi-supervised deep learning based on label propagation in a 2D embedded space. CoRR abs/2008.00558 (2020). https://arxiv.org/abs/2008.00558
5. Bereg, S., Díaz-Báñez, J.M., Lara, D., Pérez-Lantero, P., Seara, C., Urrutia, J.: On the coarseness of bicolored point sets. Comput. Geom. 46(1), 65–77 (2013). https://doi.org/10.1016/j.comgeo.2012.04.003