#### Filter Results:

- Full text PDF available (200)

#### Publication Year

1997

2017

- This year (12)
- Last 5 years (248)
- Last 10 years (460)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Data Set Used

#### Key Phrases

#### Method

Learn More

- Pavel Krömer, Jan Platos, Václav Snásel
- International Journal of Parallel Programming
- 2013

Graphic processing units (GPUs) emerged recently as an exciting new hardware environment for a truly parallel implementation and execution of Nature and Bio-inspired Algorithms with excellent price-to-power ratio. In contrast to common multicore CPUs that contain up to tens of independent cores, the GPUs represent a massively parallel single-instruction… (More)

- Tomás Skopal, Jaroslav Pokorný, Václav Snásel
- ADBIS
- 2004

In this paper we introduce the Pivoting M-tree (PM-tree), a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hyper-sphere, in PM-tree the shape of a metric region is determined by intersection of the hyper-sphere and a set of hyper-rings. The set of hyper-rings for each metric region is… (More)

- Tomás Skopal, Michal Krátký, Jaroslav Pokorný, Václav Snásel
- Inf. Syst.
- 2006

In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently,… (More)

- Václav Snásel, Ajith Abraham, Suhail S. J. Owais, Jan Platos, Pavel Krömer
- Foundations of Computational Intelligence
- 2009

- Hesam Izakian, Ajith Abraham, Václav Snásel
- 2009 International Joint Conference on…
- 2009

Scheduling is one of the core steps to efficientlyexploit the capabilities of heterogeneous distributedcomputing systems and is an NP-complete problem.Therefore using meta-heuristic algorithms is asuitable approach in order to cope with its difficulty.In meta-heuristic algorithms, generating individualsin the initial step has an important effect on… (More)

- Tomás Skopal, Jaroslav Pokorný, Václav Snásel
- DASFAA
- 2005

We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases. As an extension of M-tree, the structure of PM-tree exploits local dynamic pivots (like M-tree does it) as well as global static pivots (used by LAESA-like methods). While in M-tree a… (More)

- Pavel Krömer, Jan Platos, Václav Snásel, Ajith Abraham
- SMC
- 2011

Fuzzy sets and fuzzy logic can be used for efficient data classification by fuzzy rules and fuzzy classifiers. This paper presents an application of genetic programming to the evolution of fuzzy classifiers based on extended Boolean queries. Extended Boolean queries are well known concept in the area of fuzzy information retrieval. An extended Boolean query… (More)

Scheduling is one of the core steps to efficiently exploit the capabilities of emergent computational systems such as grid. Grid environment is a dynamic, heterogeneous and unpredictable one sharing different services among many different users. Because of heterogeneous and dynamic nature of grid, the methods used in traditional systems could not be applied… (More)

- Suhail S. J. Owais, Václav Snásel, Pavel Krömer, Ajith Abraham
- 2008 7th Computer Information Systems and…
- 2008

The wide spread use of computer networks in today's society, especially the sudden surge in importance of the World Wide Web, has made computer network security an international priority. Since it is not technically feasible to build a system with no vulnerabilities, intrusion detection (ID) has become an important area for researches. An intrusion that… (More)

- Pavel Krömer, Jan Platos, Václav Snásel
- 2014 Eighth International Conference on Complex…
- 2014

The column subset selection problem is a well-known hard optimization problem of selecting an optimal subset of k columns from the matrix A<sup>m×n</sup>, k<; n, so that the cost function is minimized. The problem is of practical importance for data mining and processing since it can be used for unsupervised feature selection, dimension reduction,… (More)