Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bolonia study programme

Options:
  Reset


1 - 6 / 6
First pagePrevious page1Next pageLast page
1.
Further results on the relation between nonlinearity and resiliency for Boolean functions
Enes Pašalić, Thomas Johansson, 1999, published scientific conference contribution (invited lecture)

Abstract: A good design of a Boolean function used in a stream cipher requires that the function satisfies certain criteria in order to resist different attacks. In this paper we study the tradeoff between two such criteria, the nonlinearity and the resiliency. The results are twofold. Firstly, we establish the maximum nonlinearity for a fixed resiliency in certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with good nonlinearity and some fixed resiliency.
Found in: ključnih besedah
Summary of found: ...certain cases. Secondly, we present a simple search algorithm for finding Boolean functions with good...
Keywords: Boolean functions, cryptography, optimisation, search problems, stream cipher, attacks, maximum nonlinearity, search algorithm, fixed resiliency
Published: 15.10.2013; Views: 1380; Downloads: 68
URL Full text (0,00 KB)

2.
Predstavitev objektov z multimnožicami v sistemih za informacijsko povpraševanje
Mikita Akulich, 2017, undergraduate thesis

Found in: ključnih besedah
Summary of found: ...trie, multiset-trie, information retrieval, inverted index, full-text search...
Keywords: multiset, bag-of-words, trie, multiset-trie, information retrieval, inverted index, full-text search
Published: 30.09.2018; Views: 317; Downloads: 5
URL Full text (0,00 KB)

3.
On the end-vertex problem of graph searches
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Mitrović, Robert Scheffler, Martin Strehler, 2019, original scientific article

Found in: ključnih besedah
Summary of found: ...end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph...
Keywords: end-vertex, graph search, maximum cardinality search, maximal neighborhood search, graph classes
Published: 22.08.2019; Views: 141; Downloads: 6
URL Full text (0,00 KB)

4.
Recognizing graph search trees
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Mitrović, Robert Scheffler, Martin Strehler, 2019, original scientific article

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: search tree recognition, LBFS, LDFS, MNS, MCS
Published: 16.10.2019; Views: 102; Downloads: 29
URL Full text (0,00 KB)

5.
A two-stage heuristic for the university course timetabling problem
Balázs Dávid, Máté Pintér, 2019, published scientific conference contribution

Found in: ključnih besedah
Summary of found: ...university course timetabling, local search, heuristic...
Keywords: university course timetabling, local search, heuristic
Published: 14.11.2019; Views: 161; Downloads: 50
URL Full text (0,00 KB)
This document has more files! More...

6.
Using constrained exhaustive search vs. greedy heuristic search for classification rule learning
Mattiev Jamolbek Maqsudovich, Branko Kavšek, 2018, published scientific conference contribution abstract

Found in: ključnih besedah
Summary of found: Zadetek v naslovu
Keywords: Data mining, machine learning, classification rules, association rules, search, heuristics
Published: 14.11.2019; Views: 162; Downloads: 46
.pdf Full text (11,75 MB)
This document has more files! More...

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica