Dirichlet's principle revisited: An inverse Dirichlet's principle definition and its bound estimation improvement using stochastic combinatorics
Saved in:
Main Authors: | Lubomír Štěpánek, Filip Habarta, Ivana Malá, Luboš Marek |
---|---|
Format: | Article |
Language: | English |
Published: |
Polish Information Processing Society
2022-09-01
|
Series: | Annals of computer science and information systems |
Online Access: | https://annals-csis.org/Volume_32/drp/pdf/221.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A random forest-based approach for survival curves comparing: principles, computational aspects and asymptotic time complexity analysis
by: Lubomír Štěpánek, et al.
Published: (2021-09-01) -
A short note on post-hoc testing using random forests algorithm: Principles, asymptotic time complexity analysis, and beyond
by: Lubomír Štěpánek, et al.
Published: (2022-09-01) -
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
by: Lubomír Štěpánek, et al.
Published: (2023-09-01) -
Let's estimate all parameters as probabilities: Precise estimation using Chebyshev's inequality, Bernoulli distribution, and Monte Carlo simulations
by: Lubomír Štěpánek, et al.
Published: (2023-09-01) -
Analysis of asymptotic time complexity of an assumption-free alternative to the log-rank test
by: Lubomír Štěpánek, et al.
Published: (2020-09-01)