Results 211 to 220 of about 11,209 (254)
Some of the next articles are maybe not open access.
2017
The problem of estimating the domain of attraction for control systems with actuator saturation, both in the continuous-time and discrete-time settings, has been extensively studied during the past decades. A large number of results have emerged in the literature.
Yuanlong Li, Zongli Lin
openaire +1 more source
The problem of estimating the domain of attraction for control systems with actuator saturation, both in the continuous-time and discrete-time settings, has been extensively studied during the past decades. A large number of results have emerged in the literature.
Yuanlong Li, Zongli Lin
openaire +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 +1 more source
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 +1 more source
1982
Given a set of n points in the plane, a method is described for constructing a nested sequence of m < n/2 convex polygons based on the points. If the points are a random sample, it is shown that the convex sets share some of the distributional properties of one-dimensional order statistics.
openaire +1 more source
Given a set of n points in the plane, a method is described for constructing a nested sequence of m < n/2 convex polygons based on the points. If the points are a random sample, it is shown that the convex sets share some of the distributional properties of one-dimensional order statistics.
openaire +1 more source
1987
This chapter investigates the problem of constructing the convex hull of a finite set of points in E d , that is, of producing a meaningful representation of the convex hull. If P is a finite set of points in E d , then we write convP for the convex hull of P.
openaire +1 more source
This chapter investigates the problem of constructing the convex hull of a finite set of points in E d , that is, of producing a meaningful representation of the convex hull. If P is a finite set of points in E d , then we write convP for the convex hull of P.
openaire +1 more source
2015
The convex hull problem is an important problem in computational geometry with such diverse applications as clustering, robot motion planning, convex relaxation, image processing, collision detection, infectious disease tracking, nuclear leak tracking, extent estimation, among many others.
openaire +1 more source
The convex hull problem is an important problem in computational geometry with such diverse applications as clustering, robot motion planning, convex relaxation, image processing, collision detection, infectious disease tracking, nuclear leak tracking, extent estimation, among many others.
openaire +1 more source
Convex-Hull Feature Adaptation for Oriented and Densely Packed Object Detection
IEEE Transactions on Circuits and Systems for Video Technology, 2022guo zonghao, Xiaosong Zhang, Chang Liu
exaly