Search results for: MINIMAL SURFACE - Bridge of Knowledge

Search

Search results for: MINIMAL SURFACE

Best results in : Research Potential Pokaż wszystkie wyniki (50)

Search results for: MINIMAL SURFACE

Best results in : Business Offer Pokaż wszystkie wyniki (9)

Search results for: MINIMAL SURFACE

Other results Pokaż wszystkie wyniki (249)

Search results for: MINIMAL SURFACE

  • Minimal surfaces and conservation laws for bidimensional structures

    We discuss conservation laws for thin structures which could be modeled as a material minimal surface, i.e., a surface with zero mean curvatures. The models of an elastic membrane and micropolar (six-parameter) shell undergoing finite deformations are considered. We show that for a minimal surface, it is possible to formulate a conservation law similar to three-dimensional non-linear elasticity. It brings us a path-independent...

    Full text available to download

  • Minimal Sets of Lefschetz Periods for Morse-Smale Diffeomorphisms of a Connected Sum of g Real Projective Planes

    Publication

    - Year 2022

    The dataset titled Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes contains all of the values of the topological invariant called the minimal set of Lefschetz periods, computed for Morse-Smale diffeomorphisms of a non-orientable compact surface without boundary of genus g (i.e. a connected sum of g real projective planes), where g varies from 1 to...

    Full text available to download

  • Minimal 2-dominating sets in Trees

    We provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.

    Full text to download in external service

  • Minimal double dominating sets in trees

    Publication

    - Year 2014

    We provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.

  • Vehicle detector training with minimal supervision

    Publication

    - Year 2019

    Recently many efficient object detectors based on convolutional neural networks (CNN) have been developed and they achieved impressive performance on many computer vision tasks. However, in order to achieve practical results, CNNs require really large annotated datasets for training. While many such databases are available, many of them can only be used for research purposes. Also some problems exist where such datasets are not...