scispace - formally typeset
Search or ask a question
Institution

Brno University of Technology

EducationBrno, Czechia
About: Brno University of Technology is a education organization based out in Brno, Czechia. It is known for research contribution in the topics: Fracture mechanics & Filter (video). The organization has 6339 authors who have published 15226 publications receiving 194088 citations. The organization is also known as: Vysoké učení technické v Brně & BUT.


Papers
More filters
01 Apr 2004
TL;DR: In this article, the comparison of various estimators of the m parameter from the Nakagami distribution has been conducted in biomedical engineering, particularly the ultrasound tissue characterization in the echocardiographic application.
Abstract: This article deals with the comparison of various estimators of the m parameter from the Nakagami distribution. This kind of distribution has been used in many engineering applications and we present another possible application in biomedical engineering, particularly the ultrasound tissue characterization in the echocardiographic application. Matlab 6.5 was used as a proper tool for fast and efficient scientific research. ( ) ( ) 0 e 2 2 1 2 ≥ Ω Γ =         Ω − − V V m m V p mV

43 citations

Book ChapterDOI
12 Sep 2005
TL;DR: An evolvable image filter which is completely implemented in a field programmable gate array which is able to evolve an image filter in a few seconds if corrupted and original images are supplied by user.
Abstract: This paper describes an evolvable image filter which is completely implemented in a field programmable gate array. The proposed system is able to evolve an image filter in a few seconds if corrupted and original images are supplied by user. The architecture is generic and can easily be modified to realize other evolvable systems. COMBO6 card with Xilinx Virtex xc2v3000 FPGA is used as a target platform.

43 citations

Proceedings ArticleDOI
12 May 2019
TL;DR: This paper focuses on the implementation of speaker embeddings extracted with deep neural networks on a more generic toolkit than Kaldi, and examines several tricks in training, such as the effects of normalizing input features and pooled statistics, different methods for preventing overfitting as well as alternative non-linearities that can be used instead of Rectifier Linear Units.
Abstract: Recently, speaker embeddings extracted with deep neural networks became the state-of-the-art method for speaker verification. In this paper we aim to facilitate its implementation on a more generic toolkit than Kaldi, which we anticipate to enable further improvements on the method. We examine several tricks in training, such as the effects of normalizing input features and pooled statistics, different methods for preventing overfitting as well as alternative non-linearities that can be used instead of Rectifier Linear Units. In addition, we investigate the difference in performance between TDNN and CNN, and between two types of attention mechanism. Experimental results on Speaker in the Wild, SRE 2016 and SRE 2018 datasets demonstrate the effectiveness of the proposed implementation.

43 citations

Posted Content
TL;DR: This work reduces the entailment problem for a non-trivial subset of SL describing trees to the language inclusion of tree automata (TA), which provides tight complexity bounds for the problem and shows that entailment in this fragment is EXPTIME-complete.
Abstract: Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated verification procedure based on SL is the decidability of the entailment problem. In this work, we reduce the entailment problem for a non-trivial subset of SL describing trees (and beyond) to the language inclusion of tree automata (TA). Our reduction provides tight complexity bounds for the problem and shows that entailment in our fragment is EXPTIME-complete. For practical purposes, we leverage from recent advances in automata theory, such as inclusion checking for non-deterministic TA avoiding explicit determinization. We implemented our method and present promising preliminary experimental results.

43 citations


Authors

Showing all 6383 results

NameH-indexPapersCitations
Georg Kresse111430244729
Patrik Schmuki10976352669
Michael Schmid8871530874
Robert M. Malina8869138277
Jiří Jaromír Klemeš6456514892
Alessandro Piccolo6228414332
René Kizek6167216554
George Danezis5920911516
Stevo Stević583749832
Edvin Lundgren5728610158
Franz Halberg5575015400
Vojtech Adam5561114442
Lukas Burget5325221375
Jan Cermak532389563
Hynek Hermansky5131714372
Network Information
Related Institutions (5)
Vienna University of Technology
49.3K papers, 1.3M citations

87% related

Polytechnic University of Catalonia
45.3K papers, 949.3K citations

86% related

Fraunhofer Society
40.1K papers, 820.8K citations

86% related

Polytechnic University of Milan
58.4K papers, 1.2M citations

86% related

Aalto University
32.6K papers, 829.6K citations

85% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202328
2022106
20211,053
20201,010
20191,214
20181,131