Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

Filtry

33 266 (0,133s)

Výsledek výzkumu

A New Range Query Algorithm for Universal B-trees

A New Range Query Algorithm for Universal B-trees...

JC - Počítačový hardware a software

  • 2006
  • Jx
Výsledek výzkumu

A New Range Query Algorithm for Universal B-trees

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. T...

IN - Informatika

  • 2005
  • A
Výsledek výzkumu

Evolutionary Algorithms for Boolean Queries Optimization

Usage of genetic algorithms in the Information Retrieval area, especially in optimizing a Boolean query, is presented in this paper. The proposed evolution of Boolean queries should increase the performance of the informati...

BA - Obecná matematika

  • 2006
  • Jx
Výsledek výzkumu

Occlusion Culling with Statistically Optimized Occlusion Queries

of queries performed per frame. The algorithm is applicable to any kind of sceneThis paper presents an effective algorithm for occlusion culling using hardware occlusion queries. The number of queries is ...

IN - Informatika

  • 2005
  • D
Výsledek výzkumu

Benchmarking the UB-tree

ability to effectively perform the range queries. In the case of UB-trees, we have proposedan advanced range query algorithm making possible to operate on indices of high dimensionality. In this paper we present experiment...

JC - Počítačový hardware a software

  • 2003
  • D
Výsledek výzkumu

Processing of Range Query Using SIMD and GPU

, and GPU variants of the range query algorithm. These results make possible a futureOnedimensional or multidimensional range query is one of the most important query of physical implementation of DBMS. The number ...

IN - Informatika

  • 2013
  • D
  • Odkaz
Výsledek výzkumu

Boolean Queries Optimization by Genetic Algorithms

Most of information retrieval systems depend on Boolean queries algorithms have been widely applied in the information retrieval area, in all of aweighting scheme. In this paper, we deal with using of Genetic algorithms in ...

BB - Aplikovaná statistika, operační výzkum

  • 2005
  • Jx
Výsledek výzkumu

On the efficiency of a prefix path holistic algorithm

and they prove algorithm optimality depending on query characteristics. In this article, we introduce a variant of the TwigStack algorithm which can work with various streaming schemes. Its efficiency does not deteriorate ...

IN - Informatika

  • 2009
  • D
Výsledek výzkumu

Evolutionary improvement of search queries and its parameters

The formulation of user queries is an important part of the information retrieval process. In the complex environment of the World Wide Web and other large data in an optimal way. In this paper, we investigate evolutionary algorithms

IN - Informatika

  • 2010
  • D
  • Odkaz
Výsledek výzkumu

Active Imitation Learning with Noisy Guidance

Imitation learning algorithms provide state-of-the-art results on many structured prediction tasks by learning near-optimal search policies. Such algorithms queried state; unfortunately, the number of such queries ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020
  • O
  • Odkaz
  • 1 - 10 z 33 266