Results 211 to 220 of about 11,419 (259)

Energy-dissipative adaptive-step L1 discretisation for the Caputo time-fractional incompressible magnetohydrodynamic system. [PDF]

Sci Rep
Abidin MZ.
europepmc   +1 more source

Frequency Band Analysis of Multiple Stationary Time Series. [PDF]

Stat Med
Brubaker CK, Manning JP, Yentes JM, Bruce SA.   +3 more
europepmc   +1 more source

Deep Reinforcement Learning for Secure and Low-Latency Communications in UAV-Mounted STAR-RIS Assisted Urban Vehicular Networks. [PDF]

Sensors (Basel)
Tang J, Yuan J, Zhao H, Chen M, Peng Y.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Binary space partitions of orthogonal subdivisions

Proceedings of the twentieth annual symposium on Computational geometry, 2004
Summary: We consider the problem of constructing Binary Space Partitions (BSPs) for orthogonal subdivisions (space-filling packings of boxes) in \(d\)-space. We show that a subdivision with \(n\) boxes can be refined into a BSP of size \(O(n^{(d+1)/{3}})\) for all \(d \geq 3\) and that such a partition can be computed in time \({O(K\log n)}\), where ...
John Hershberger 0001, Subhash Suri, Csaba D. Tóth   +2 more
openaire   +1 more source

Partitioning and separating sets of orthogonal polygons

Information Sciences, 1987
A geometrical object in the plane is said to be orthogonal if its edges are either vertical or horizontal. A polygon is called orthoconvex if for every vertical-or-horizontal segment, its two endpoints lying in the polygon implies the whole segment lying in the polygon.
Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood   +2 more
openaire   +1 more source

Orthogonal Partitions in Designed Experiments

Designs, Codes and Cryptography, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Partitioning Orthogonal Histograms into Rectangular Boxes

2018
The problem of partitioning an orthogonal polyhedron into a minimum number of boxes was shown to be NP-hard in 1991, but no approximability result is known except for a 4-approximation algorithm for 3D-histograms. In this paper we broaden the understanding of the 3D-histogram partitioning problem.
Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte   +5 more
openaire   +1 more source