Results 331 to 340 of about 542,162 (354)
Some of the next articles are maybe not open access.
Convex-Hull Feature Adaptation for Oriented and Densely Packed Object Detection
IEEE transactions on circuits and systems for video technology (Print), 2022Zonghao Guo +5 more
semanticscholar +1 more source
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
Mathematical programming, 2015We investigate how well the graph of a bilinear function $$b{:}\;[0,1]^n\rightarrow \mathbb {R}$$b:[0,1]n→R can be approximated by its McCormick relaxation.
N. Boland +4 more
semanticscholar +1 more source
L-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS
, 2017The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between $L$-convex systems and Scott-hull spaces.
Chong Shen, F. Shi̇
semanticscholar +1 more source
The restricted hull operator of M-fuzzifying convex structures
Journal of Intelligent & Fuzzy Systems, 2015In this paper, the notion of M-fuzzifying restricted hull operators is introduced and several equivalent characterizations are given. It is shown that there is a one-to-one correspondence between M-fuzzifying restricted hull operators and M-fuzzifying ...
F. Shi̇, E. Li
semanticscholar +1 more source
Recognition of Handwritten Bangla Basic Characters and Digits using Convex Hull based Feature Set
arXiv.org, 2014In dealing with the problem of recognition of handwritten character patterns of varying shapes and sizes, selection of a proper feature set is important to achieve high recognition performance. The current research aims to evaluate the performance of the
N. Das +6 more
semanticscholar +1 more source
1998
The h-principle. Let p: X: → V be a smooth bundle, q-dimensional fibers, over a smooth n-dimensional manifold V, n ≥ 1; s : X (r) → V is the source map.
openaire +2 more sources
The h-principle. Let p: X: → V be a smooth bundle, q-dimensional fibers, over a smooth n-dimensional manifold V, n ≥ 1; s : X (r) → V is the source map.
openaire +2 more sources
2013
When referring to “computation of convex hulls” we understand this as the task of computing the \(\mathcal {H}\)-representation of the convex hull of a given finite point set V⊆ℝ n . Depending on the desired application, one might also need to compute all faces, a description of the face lattice or other geometric information.
Thorsten Theobald, Michael Joswig
openaire +2 more sources
When referring to “computation of convex hulls” we understand this as the task of computing the \(\mathcal {H}\)-representation of the convex hull of a given finite point set V⊆ℝ n . Depending on the desired application, one might also need to compute all faces, a description of the face lattice or other geometric information.
Thorsten Theobald, Michael Joswig
openaire +2 more sources
2011
Convex hulls in the plane are examples for shortest paths around sets of points, or around simple polygons. Possibly these paths may be constrained by available polygonal regions. This chapter explains a few exact algorithms in this area which run typically in linear or (nlogn)-time with respect to a given input parameter n. However, the problems could
Reinhard Klette, Fajie Li
openaire +2 more sources
Convex hulls in the plane are examples for shortest paths around sets of points, or around simple polygons. Possibly these paths may be constrained by available polygonal regions. This chapter explains a few exact algorithms in this area which run typically in linear or (nlogn)-time with respect to a given input parameter n. However, the problems could
Reinhard Klette, Fajie Li
openaire +2 more sources
The convex hull of the disjunction of polymatroids
2000Rapport interne.
Bockmayr, Alexander, Pisaruk, Nicolai
openaire +3 more sources