Filip Habarta
According to our database1,
Filip Habarta
authored at least 9 papers
between 2020 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
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
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