๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Numerical characteristics of systems of straight lines on complete intersections

โœ Scribed by A. S. Libgober


Publisher
SP MAIK Nauka/Interperiodica
Year
1973
Tongue
English
Weight
308 KB
Volume
13
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the intersection of edges of a geomet
โœ N. Alon; M.A. Perles ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 969 KB

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0

Numerical integration approach to on-lin
โœ Setsuo Sagara; Zhen-Yu Zhao ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 926 KB

A discrete-time method is developed for parameter estimation of continuous-time systems. The use of a linear integral filter overcomes the initial condition problem and simplifies the application of the results from discrete-time model identification in continuous-time system identification.