All

What are you looking for?

All
Projects
Results
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

96 522 (0,155s)

Result

Affine trajectories in a field of strictly convex functions

of their differentiability, and also point out some geometric characteristics of the sets of all points has an important geometric interpretation. This paper connects the proved......

BA - Obecná matematika

  • 2015
  • Jx
  • Link
Result

Stochastic hyperplane-based ranks and their use in multivariate portmanteau tests

. It is based on new stochastic hyperplane-based ranks that are simpler and easier to compute than other usable hyperplane-based competitors and still share with them many good properties such as their distribution-free nature, ...

Statistics and probability

  • 2024
  • Jimp
  • Link
Result

Robust Barycentric Coordinates Computation of the Closest Point to a Hyperplane in En

Robust computation of barycentric coordinates of the closest point to on a hyperplane is presented.

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

  • 2013
  • D
Result

Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences

the best known lower bound for the maximum number of point-hyperplane incidences statement is true. There is a set of n points in R^d and an arrangement of m hyperplanes needed to cover all points in the ...

Pure mathematics

  • 2017
  • D
  • Link
Result

Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences

for the maximum number of point-hyperplane incidences by Brass and Knauer (Comput Geom 25(1-2. There is a set of n points in Rd and an arrangement of m hyperplanes in Rd with no Kr,r points in K. In parti...

Pure mathematics

  • 2019
  • Jimp
  • Link
Result

Covering Points by Hyperplanes and Related Problems

For a set P of n points in Rd, for any d >= 2, a hyperplane h is called k-rich with respect to P if itcontains at least k points of P. Answering hyperplanes in Rd, d >= 3, is at least Ω(nd/kα + n/k), with asu...

Pure mathematics

  • 2022
  • D
  • Link
Result

Simson-Wallace locus in d-dimensional projective - metric space

, i.e. we look for the points whose orthogonal projections onto the hyperplanes of a fixed d-simplex lie on a hyperplane d -1 plane. We show that this Simson-Wallace locus is a (hyper)surface of d+1 degree, if the metric

Pure mathematics

  • 2017
  • JSC
  • Link
Result

Barycentric cuts through a convex body

). Given a point p in the interior of K, a hyperplane h passing through p is called the question whether, for every K, there exists an interior point p through which there are at least n+1 distinct barycentric hyperplan...

Pure mathematics

  • 2020
  • D
  • Link
Result

Geometric Hyperplanes of the Near Hexagon L-3 x GQ(2,2)

Having in mind their potential quantum physical applications, we classify all geometric hyperplanes of the near hexagon that is a direct product of a line of size three and the generalized quadrangle of order two. There are eight different k...

CF - Fyzikální chemie a teoretická chemie

  • 2010
  • Jx
Result

Recognition of partially occluded and deformed binary objects

A method dealing with recognition of partially occluded and affine transformed binary objects is presented. The method is designed for objects with smooth curved boundary. It divides an object into affine-invariant parts an...

IN - Informatika

  • 2008
  • Jx
  • 1 - 10 out of 96 522