#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2000

2016

- This year (0)
- Last 5 years (9)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Martin Klimo, Ondrej Such
- ArXiv
- 2011

In our work we propose implementing fuzzy logic using memristors. Min and max operations are done by antipodally configured memristor circuits that may be assembled into computational circuits. We discuss computational power of such circuits with respect to m-efficiency and experimentally observed behavior of memristive devices. Circuits implemented with… (More)

- Lutz Nielen, Ondrej Such, Martin Klimo, Rainer Waser, Eike Linn
- IJUC
- 2016

- Ondrej Such
- 2000

The simplicity of this equation makes these hyperelliptic curves particularly well suited for explicit computer calculations requiring higher genus curves. On the other hand, the special form of the equation raises the question of how generic or random, if at all, these curves are. For instance, all of these curves have 2-rank 0. The question of genericity… (More)

- Ondrej Such
- ArXiv
- 2013

In our work we define a new algebra of operators as a substitute for fuzzy logic. Its primary purpose is for construction of binary discriminators for phonemes based on spectral content. It is optimized for design of non-parametric computational circuits, and makes uses of 4 operations: min, max, the difference and generalized additively homogenuous means.

- Ondrej Such, Eike Linn, Martin Klimo, Peter Jancovic, Milan Fratrik, Karol Fröhlich
- IEEE J. Emerg. Sel. Topics Circuits Syst.
- 2015

- Ondrej Such
- Finite Fields and Their Applications
- 2005

where f is a polynomial of degree e in n variables with coefficients in a finite field F of characteristic p, E is an overfield of F, and ψ is an additive character of F. It is interesting to ask what happens with sums S(E, f) when one varies E, or when one varies f . In order to talk precisely about the latter, we denote by P(e, n) the scheme… (More)

- Ondrej Such
- 2007

We prove a criterion to check whether a polynomial is irreducible. This criterion is related to trace map computations. It may be effectively used to detect irreducibility of polynomials of prime degree over their base field.

- Martin Klimo, Peter Tarabek, Ondrej Such, Juraj Smiesko, Ondrej Skvarek
- IJUC
- 2016

- Ondrej Such, Santiago Barreda
- Pattern Recognition Letters
- 2016

- Ondrej Such, Stefan Benus, Andrea Tinajová
- ITAT
- 2015

Estimating class membership probabilities is an important step in many automated speech recognition systems. Since binary classifiers are usually easier to train, one common approach to this problem is to construct pairwise binary classifiers. Pairwise models yield an overdetermined system of equations for the class membership probabilities. Motivated by… (More)