All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

-
19912025

Join usingOrAnd

Join usingOrAnd

SelectAll/None
  • Show more

SelectAll/None
  • Show more

      • Show more

      • Show more

      • Show more

      • Show more

      • Show more

    • Show more

SelectAll/None
  • Show more

More filters

Results

52 164 results (0,216s)

Result

Convergence rates of kernel density estimates in particle filtering

Bounds on convergence rates of kernel density estimates in particle filtering are specified. The kernel density estimates are shown to be efficient for the Sobolev class of filtering densities. The upper bounds are...

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

  • 2019
  • Jimp
  • Link
Result

Convergence rates of kernel density estimates in particle filtering

Bounds on convergence rates of kernel density estimates in particle filtering are specified. The kernel density estimates are shown to be efficient for the Sobolev class of filtering densities. The upper bounds are...

Statistics and probability

  • 2019
  • Jimp
  • Link
Result

Markov kernels and tribes

We define an ordering on the set of bounded Markov kernels associated kernels is a Dedekind sigma-complete lattice. In addition, we define a sum of bounded Markov kernels such that the set of bounded

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

  • 2018
  • Jimp
  • Link
Result

Kernel choice with respect to the bandwidth in kernel density estimates

We focus on the kernel function choice, especially on kernels with a bounded support. Our aim is to study the optimality of the kernel with respect to the bandwidth choice. A simulation study brings comparison of t...

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

  • 2011
  • D
Result

Independent sets near the lower bound in bounded degree graphs

of graphs with independence number close to this bound, and use it to show/Delta+k has a kernel of size O(k).

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

  • 2017
  • D
  • Link
Result

Kernel choice in bivariate kernel density derivative estimates

, especially kernels with bounded supports, with respect to the bandwidth choice.Kernel estimates belong to the most popular nonparametric method of estimating on a bandwidth, which controls the smoothness of the estimate, ...

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

  • 2011
  • D
  • Link
Result

Kernelization Using Structural Parameters on Sparse Graph Classes

for linear kernels on graphs of bounded genus, H-minor-free graphs, and H-topological for kernels for any of the larger sparse graph classes: graphs of bounded expansion, locally bounded expansion, and no...

IN - Informatika

  • 2013
  • D
  • Link
Result

Tikhonov regularization parameter in reproducing kernel Hilbert Spaces with respect to the sensitivity of the solution

In our paper, we consider Tikhonov regularization in the reproducing Kernel Hilbert Spaces. In this space we derive upper and lower bound of the interval which contains the optimal value of Tikhonov regularization parameter...

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

  • 2008
  • D
Result

Bounds for Approximate Solutions of Fredholm Integral Equations Using Kernel Networks

Approximation of solutions of integral equations by networks with kernel units is investigated theoretically. There are derived upper bounds on speed of decrease of errors in approximation of solutions of Fredholm integral equations...

IN - Informatika

  • 2011
  • D
  • Link
Result

Weighted Bergman kernels and quantization.

The paper generalizes results on the asymptotic behaviour of the Bergman kernels and of the Berezin transform to pseudoconvex domains which need not be smoothly bounded and to metrics which need not be real-analytic. For smoothly

BA - Obecná matematika

  • 2002
  • Jx
  • 1 - 10 out of 52 164