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

47 259 (0,144s)

Result

An efficient linearity-and-bound-preserving remapping method

In this paper we describe an efficient, local-bound-preserving conservative interpolation (remapping) algorithm, which is exact for a global linear function (linearity-preserving). The algorithm is based on reconst...

BA - Obecná matematika

  • 2003
  • Jx
Result

A Numerical Comparison of Iterative Algorithms for Inconsistency Reduction in Pairwise Comparisons

preservation. The Xu and Wei's algorithm is the best with regard to the preservationThe aim of this paper is to compare selected iterative algorithms. Subsequently, we evaluate the algorithms' performance...

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

  • 2021
  • Jimp
  • Link
Result

A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation

algorithm in order to make the algorithm preserve the topology of an initial interface. This algorithm is being widely used in computer vision and image processing fields forits-completeness of the topology pr...

IN - Informatika

  • 2011
  • D
Result

A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation

algorithm in order to make the algorithm preserve the topology of an initial interface. This algorithm is being widely used in computer vision and image processing fields forits-completeness of the topology pr...

IN - Informatika

  • 2010
  • D
Result

Symmetry preserving algorithm for a dynamic contact-impact problem

A three dimensional contact-impact algorithm based on the pre-discretization penalty method is presented. It is shown that the proposed method preserves a symmetric treatment of mutually contacting surfaces. The symmetry of the ...

JJ - Ostatní materiály

  • 2004
  • D
Result

Symetry preserving algorithm for a dynamic contact-impact problem

A three dimensional contact-impact algorithm based on the pre-discretization penalty method is presented. It is shown that the proposed method preserves a symmetric treatment of mutually contacting surfaces. The symmetry of the ...

JJ - Ostatní materiály

  • 2006
  • D
Result

A Fast Level Set-Like Algorithm with Topology Preserving Constraint

to obtain a fast topology-preserving algorithm for implicit active contours. contour is not desirable. Imposing topology-preserving constraints on evolving. In this paper, we build on the work by Han et al. (2003) introduc...

IN - Informatika

  • 2009
  • D
Result

Non-Interleaving Bisimulation Equivalences on Basic Parallel Processes

We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n^3 log n)) and history preserving bisimilarity (in O(n^6)) on the class Basic Parallel Processes. The latter algorithm

IN - Informatika

  • 2010
  • Jx
Result

History Preserving Bisimilarity on Basic Parallel Processes

A new polynomial time algorithm for deciding history preserving bisimilarity on Basic Parallel Processes (BPP) is presented. Also a new new more transparent definition of history preserving bisimilarity on BPP is provided....

IN - Informatika

  • 2006
  • D
Result

Automorphisms and Isomorphisms of Maps in Linear Time

can be thought of as a permutation of the vertices which preserves the vertex-edge automorphism of a map determines an angle-preserving homeomorphism of the surface. While it is conjectured that there is no “truly subquadratic”

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

  • 2021
  • D
  • Link
  • 1 - 10 out of 47 259