Zobrazeno 1 - 10
of 191
pro vyhledávání: '"Ábrahám Erika"'
In this paper we present YOLOX-ViT, a novel object detection model, and investigate the efficacy of knowledge distillation for model size reduction without sacrificing performance. Focused on underwater robotics, our research addresses key questions
Externí odkaz:
http://arxiv.org/abs/2403.09313
Autor:
Kremer Gereon, Ábrahám Erika
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 10, Iss 1, Pp 5-25 (2018)
In this paper we present the latest developments in SMT-RAT, a tool for the automated check of quantifier-free real and integer arithmetic formulas for satisfiability. As a distinguishing feature, SMT-RAT provides a set of solving modules and support
Externí odkaz:
https://doaj.org/article/e41d7489e48744bea751ccba3d721b72
Publikováno v:
EPTCS 395, 2023, pp. 30-68
In this paper, we extend an available neural network verification technique to support a wider class of piece-wise linear activation functions. Furthermore, we extend the algorithms, which provide in their original form exact respectively over-approx
Externí odkaz:
http://arxiv.org/abs/2311.10780
Publikováno v:
EPTCS 390, 2023, pp. 16-32
In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to reduce the wor
Externí odkaz:
http://arxiv.org/abs/2310.00995
In this paper we present a quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to reduce the worst-case
Externí odkaz:
http://arxiv.org/abs/2309.03138
Different stochastic extensions of hybrid automata have been proposed in the past, with unclear expressivity relations between them. To structure and relate these modeling languages, in this paper we formalize two alternative approaches to extend hyb
Externí odkaz:
http://arxiv.org/abs/2307.08052
Probabilistic hyperproperties express probabilistic relations between different executions of systems with uncertain behavior. HyperPCTL allows to formalize such properties, where quantification over probabilistic schedulers resolves potential non-de
Externí odkaz:
http://arxiv.org/abs/2307.05282
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to exploit the stri
Externí odkaz:
http://arxiv.org/abs/2306.16757
This paper proposes an algorithm to maximize reachability probabilities for rectangular automata with random clocks via a history-dependent prophetic scheduler. This model class incorporates time-induced nondeterminism on discrete behavior and nondet
Externí odkaz:
http://arxiv.org/abs/2304.14996