Results 51 to 60 of about 70,207 (165)
Some inequalities for two simplices in the Euclidean space En. [PDF]
Pan J, Zuo X.
europepmc +1 more source
Modified Sweeping Surfaces in Euclidean 3-Space
In this study, we explore the sweeping surfaces in Euclidean 3-space, utilizing the modified orthogonal frames with non-zero curvature and torsion, which allows us to consider the spine curves even if their second differentiations vanish.
Yanlin Li +3 more
doaj +1 more source
Geometry of conformal vector fields
It is well known that the Euclidean space (Rn,〈,〉), the n-sphere Sn(c) of constant curvature c and Euclidean complex space form (Cn,J,〈,〉) are examples of spaces admitting conformal vector fields and therefore conformal vector fields are used in ...
Sharief Deshmukh
doaj +1 more source
Representing logic gates over Euclidean space via heaviside step function. [PDF]
Iacovelli G, Iacovelli C.
europepmc +1 more source
Learning behavior aware features across spaces for improved 3D human motion prediction
3D skeleton-based human motion prediction is an essential and challenging task for human-machine interactions, aiming to forecast future poses given a history of previous motions.
Ruiya Ji +3 more
doaj +1 more source
El mapa como metáfora o la espacialización del pensamiento
The expression "map" is used to name non-geographical images: map of the DNA, "site map" of online navigability, "conceptual maps", among many others. Why (or in what sense) are these images maps?
Carla Lois
doaj +1 more source
Semicomputable Points in Euclidean Spaces.
We introduce the notion of a semicomputable point in R^n , defined as a point having left-c.e. projections. We study the range of such a point, which is the set of directions on which its projections are left-c.e., and is a convex cone. We provide a thorough study of these notions, proving along the way new results on the computability of convex sets ...
Hoyrup, Mathieu, Stull, Donald
openaire +3 more sources
Space Complexity of Euclidean Clustering
The $(k, z)$-Clustering problem in Euclidean space $\mathbb{R}^d$ has been extensively studied. Given the scale of data involved, compression methods for the Euclidean $(k, z)$-Clustering problem, such as data compression and dimension reduction, have received significant attention in the literature.
Xiaoyi Zhu +3 more
openaire +5 more sources
Convexity and the Euclidean Metric of Space-Time
We address the reasons why the “Wick-rotated”, positive-definite, space-time metric obeys the Pythagorean theorem. An answer is proposed based on the convexity and smoothness properties of the functional spaces purporting to provide the kinematic ...
Nikolaos Kalogeropoulos
doaj +1 more source
Most of the existing local linear embedding algorithms assume that the original data set is located in Euclidean space, but in reality almost all the original space is non-Euclidean space.
LIU QingQiang +4 more
doaj

