Zobrazeno 1 - 10
of 1 623
pro vyhledávání: '"Hladík P"'
Binary classification tasks with imbalanced classes pose significant challenges in machine learning. Traditional classifiers often struggle to accurately capture the characteristics of the minority class, resulting in biased models with subpar predic
Externí odkaz:
http://arxiv.org/abs/2412.01936
While Dijkstra's algorithm has near-optimal time complexity for the problem of finding the shortest $st$-path, in practice, other algorithms are often superior on huge graphs. A prominent such example is the bidirectional search, which executes Dijks
Externí odkaz:
http://arxiv.org/abs/2410.14638
Autor:
Oancea, C., Resch, A., Barna, S., Magrin, G., Grevillot, L., Hladik, D., Marek, L., Jakubek, J., Granja, C.
This work investigates the operational acquisition time limits of Timepix3 and Timepix2 detectors operated in frame mode for high-count rate of high deposited energy transfer particles. Measurements were performed using alpha particles from a 241Am l
Externí odkaz:
http://arxiv.org/abs/2409.17660
Autor:
Hladík, Richard, Tětek, Jakub
Smooth sensitivity is one of the most commonly used techniques for designing practical differentially private mechanisms. In this approach, one computes the smooth sensitivity of a given query $q$ on the given input $D$ and releases $q(D)$ with noise
Externí odkaz:
http://arxiv.org/abs/2407.05067
Autor:
Hladík, Richard, Tětek, Jakub
Devising mechanisms with good beyond-worst-case input-dependent performance has been an important focus of differential privacy, with techniques such as smooth sensitivity, propose-test-release, or inverse sensitivity mechanism being developed to ach
Externí odkaz:
http://arxiv.org/abs/2404.15035
This paper provides a thorough exploration of the absolute value equations $Ax-|x|=b$, a seemingly straightforward concept that has gained heightened attention in recent years. It is an NP-hard and nondifferentiable problem and equivalent with the st
Externí odkaz:
http://arxiv.org/abs/2404.06319
Autor:
Haeupler, Bernhard, Hladík, Richard, Iacono, John, Rozhon, Vaclav, Tarjan, Robert, Tětek, Jakub
We consider the problem of sorting $n$ items, given the outcomes of $m$ pre-existing comparisons. We present a simple and natural deterministic algorithm that runs in $O(m+\log T)$ time and does $O(\log T)$ comparisons, where $T$ is the number of tot
Externí odkaz:
http://arxiv.org/abs/2404.04552
This paper proves that Dijkstra's shortest-path algorithm is universally optimal in both its running time and number of comparisons when combined with a sufficiently efficient heap data structure. Universal optimality is a powerful beyond-worst-case
Externí odkaz:
http://arxiv.org/abs/2311.11793
Publikováno v:
International Journal of Digital Earth, Vol 17, Iss 1, Pp 1-23 (2024)
This study investigates the utilization of YouTube as a data source in crisis management, focusing on human behavior during a tornado event in the Southern Moravia Region, Czech Republic, in 2021. Utilizing YouTube's Data API, we harvested video meta
Externí odkaz:
https://doaj.org/article/27c9fc86c79c43ce8ba161df563615b2
Autor:
Hladík, Milan
This paper introduces a concept of a derivative of the optimal value function in linear programming (LP). Basically, it is the the worst case optimal value of an interval LP problem when the nominal data the data are inflated to intervals according t
Externí odkaz:
http://arxiv.org/abs/2307.06733