• čeština
    • English
    • русский
    • Deutsch
    • français
    • polski
    • українська
  • polski 
    • čeština
    • English
    • русский
    • Deutsch
    • français
    • polski
    • українська
  • Zaloguj
Szukaj 
  •   Strona główna DSpace
  • Časopisy
  • Mendel
  • Vol. 25, No. 2
  • Szukaj
  •   Strona główna DSpace
  • Časopisy
  • Mendel
  • Vol. 25, No. 2
  • Szukaj
JavaScript is disabled for your browser. Some features of this site may not work without it.

Szukaj

Show Advanced FiltersHide Advanced Filters

Filtry

Użyj filtrów by uściślić zapytanie.

Wyświetlanie pozycji 1-4 z 4

  • Opcje sortowania:
  • Znaczenie
  • Tytuł (rosnąco)
  • Tytuł (malejąco)
  • Data wydania (rosnąco)
  • Data wydania (malejąco)
  • Wyników na stronę:
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
Thumbnail

How to Burn a Network or Spread Alarm 

Simon, Marek; Huraj, Ladislav; Dirgova Luptakova, Iveta; Pospichal, Jiri (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
This paper compares centrality indices usage within a heuristic method for a fast spread of alarm, or crucial information. Such indices can be used as a core part within more sophisticated optimisation methods, which should ...
Thumbnail

A Survey on Artificial Intelligence in Malware as Next-Generation Threats 

Thanh, Cong Truong; Zelinka, Ivan (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
Recent developments in Artificial intelligence (AI) have a vast transformative potential for both cybersecurity defenders and cybercriminals. Anti-malware solutions adopt intelligent techniques to detect and prevent threats ...
Thumbnail

An Ensemble-Based Malware Detection Model Using Minimum Feature Set 

Zelinka, Ivan; Amer, Eslam (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
Current commercial antivirus detection engines still rely on signature-based methods. However, with the huge increase in the number of new malware, current detection methods become not suitable. In this paper, we introduce ...
Thumbnail

Minimum-Volume Covering Ellipsoids: Improving the Efficiency of the Wolfe-Atwood Algorithm for Large-Scale Instances by Pooling and Batching 

Kudela, Jakub (Institute of Automation and Computer Science, Brno University of Technology, 2019-12-20)
The Minimum-Volume Covering Ellipsoid (MVCE) problem is an important optimization problem that comes up in various areas of engineering and statistics. In this paper, we improve the state-of-the-art Wolfe-Atwood algorithm ...

Portal of libraries | Central library on Facebook
DSpace software copyright © 2002-2015  DuraSpace
Kontakt z nami | Wyślij uwagi | Theme by @mire NV
 

 

Przeglądaj

Całe DSpaceZbiory i kolekcje Daty wydaniaAutorzyTytułyTematyTa kolekcjaDaty wydaniaAutorzyTytułyTematy

Moje konto

ZalogujZarejestruj

Odkryj

AutorZelinka, Ivan (2)Amer, Eslam (1)Dirgova Luptakova, Iveta (1)Huraj, Ladislav (1)Kudela, Jakub (1)Pospichal, Jiri (1)Simon, Marek (1)Thanh, Cong Truong (1)Tematmachine learning (2)Artificial intelligence (1)batching (1)burning number (1)centrality indices (1)complex networks (1)computer virus (1)ensemble learning (1)large-scale optimization (1)Lowner-John ellipsoid (1)... zobacz więcejData wydania2019 (4)

Portal of libraries | Central library on Facebook
DSpace software copyright © 2002-2015  DuraSpace
Kontakt z nami | Wyślij uwagi | Theme by @mire NV