Lubomír Stepánek
Orcid: 0000-0002-8308-4304
According to our database1,
Lubomír Stepánek
authored at least 21 papers
between 2017 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Claim Frequency Estimation in Motor Third-Party Liability (MTPL): Classical Statistical Models versus Machine Learning Methods.
Proceedings of the Communication Papers of the 20th Conference on Computer Science and Intelligence Systems, 2025
A statistical hypothesis test for primality based on random divisor sampling: Principles, properties, adaptive design, and algorithmic analysis.
Proceedings of the 20th Conference on Computer Science and Intelligence Systems, 2025
Improved upper bounds on the shortest watchman route in simple polygons: Dependence on reflex vertices and triangulation strategies.
Proceedings of the 20th Conference on Computer Science and Intelligence Systems, 2025
Bias in Classical Life Tables Under Censoring: A Comparative Study With Kaplan-Meier Estimation and Actuarial Estimation Using Real and Simulated Data.
Proceedings of the 20th Conference on Computer Science and Intelligence Systems, 2025
Machine learning for survival analysis: a comparative study on intensive care unit (ICU) patient data and simulations.
Proceedings of the 20th Conference on Computer Science and Intelligence Systems, 2025
2024
Non-parametric comparison of survival functions with censored data: A computational analysis of greedy and Monte Carlo approaches.
Proceedings of the 19th Conference on Computer Science and Intelligence Systems, 2024
Secretary problem revisited: Optimal selection strategy for top candidates using one try in a generalized version of the problem.
Proceedings of the 19th Conference on Computer Science and Intelligence Systems, 2024
2023
A lower bound for proportion of visibility polygon's surface to entire polygon's surface: Estimated by Art Gallery Problem and proven that cannot be greatly improved.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023
Let's estimate all parameters as probabilities: Precise estimation using Chebyshev's inequality, Bernoulli distribution, and Monte Carlo simulations.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023
2022
Application of an Inverse Dirichlet's Principle to Discrete Recreational Problems: Bound Estimation's Optimization Using Combinatorial Probability and Comparison of Numerical Bound Estimation Using Various Algorithms, Including Recursive Inclusion-Exclusion Principle.
Proceedings of the Recent Advances in Computational Optimization - Selected Papers from the WCO 2022, 2022
Dirichlet's principle revisited: An inverse Dirichlet's principle definition and its bound estimation improvement using stochastic combinatorics.
Proceedings of the Communication Papers of the 17th Conference on Computer Science and Intelligence Systems, 2022
A short note on post-hoc testing using random forests algorithm: Principles, asymptotic time complexity analysis, and beyond.
Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022
2021
Alternatives for greedy discrete subsampling: various approaches including cluster subsampling of COVID-19 data with no response variable.
Proceedings of the Position and Communication Papers of the 16th Conference on Computer Science and Intelligence Systems, 2021
A random forest-based approach for survival curves comparing: principles, computational aspects and asymptotic time complexity analysis.
Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021
2020
Feasibility of computerized adaptive testing evaluated by Monte-Carlo and post-hoc simulations.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020
Reducing the First-Type Error Rate of the Log-Rank Test: Asymptotic Time Complexity Analysis of An Optimized Test's Alternative.
Proceedings of the Recent Advances in Computational Optimization, 2020
Analysis of asymptotic time complexity of an assumption-free alternative to the log-rank test.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020
2019
Machine-Learning and R in Plastic Surgery - Evaluation of Facial Attractiveness and Classification of Facial Emotions.
Proceedings of the Information Systems Architecture and Technology: Proceedings of 40th Anniversary International Conference on Information Systems Architecture and Technology - ISAT 2019, 2019
Machine-learning at the service of plastic surgery: a case study evaluating facial attractiveness and emotions using R language.
Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019
2018
Evaluation of facial attractiveness for purposes of plastic surgery using machine-learning methods and image analysis.
Proceedings of the 20th IEEE International Conference on e-Health Networking, 2018
2017
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017