Results 81 to 90 of about 275 (106)
Some of the next articles are maybe not open access.
Hyper-Lapse From Multiple Spatially-Overlapping Videos
IEEE Transactions on Image Processing, 2018Hyper-lapse video with high speed-up rate is an efficient way to overview long videos, such as a human activity in first-person view. Existing hyper-lapse video creation methods produce a fast-forward video effect using only one video source. In this paper, we present a novel hyper-lapse video creation approach based on multiple spatially-overlapping ...
Miao Wang +5 more
openaire +2 more sources
Strongly distributive multiplicative hyperrings
Journal of Geometry, 1990The aim of this paper is to characterize the strongly distributive multiplicative hyperrings. A non trivial example is provided giving a model for such hyperrings; also a characterization theorem is proved.
openaire +1 more source
Hyper-bent Multiple-Valued Functions
2013Hyper-bent functions constitute a subset of bent functions and are harder to approximate than bent functions, making them particularly attractive for cryptographic applications. In the multiple-valued world, up to now, characterization and generation of hyper-bent functions represent an interesting challenging mathematical problem.
Claudio Moraga +3 more
openaire +1 more source
On hyper‐redundant multiple‐link robots
Laboratory Robotics and Automation, 1996In this article, an approach is presented to effectively optimize the configurations of hyper-redundant multiple-link planar manipulators. Different kinematic and static criteria are utilized, such as the manipulability and the kinematic index, but the emphasis is given on the minimum joint torques.
openaire +1 more source
Translation planes constructed by multiple hyper-regulus replacement
Journal of Geometry, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jha, Vikram, Johnson, Norman L.
openaire +1 more source
Multiplicative KV and Multiplicative Hyper -KV Indices of Certain Dendrimers
International Journal of Fuzzy Mathematical Archive, 2019In this study, we define the multiplicative KV indices and multiplicative hyper- KV indices of a graph. Also we introduce the general multiplicative KV indices of a graph. Furthermore, we compute these indices for POPAM and tetrathiafulvalene dendrimers.
openaire +1 more source
Wireless Personal Communications, 2019
In this paper, the image encryption using hyper-chaotic mapping for permutation and diffusion is proposed. 2D hyper-chaotic map is used to generate permutation order into scramble the image in the permutation stage itself. It is further diffused by multiple hyper-chaotic maps through Lorenz’s and Chen’s system.
T. Gopalakrishnan, S. Ramakrishnan
openaire +1 more source
In this paper, the image encryption using hyper-chaotic mapping for permutation and diffusion is proposed. 2D hyper-chaotic map is used to generate permutation order into scramble the image in the permutation stage itself. It is further diffused by multiple hyper-chaotic maps through Lorenz’s and Chen’s system.
T. Gopalakrishnan, S. Ramakrishnan
openaire +1 more source
\(n\)-absorbing \(I\)-prime hyperideals in multiplicative hyperrings
Summary: In this paper, we define the concept \(I\)-prime hyperideal in a multiplicative hyperring \(R\). A proper hyperideal \(P\) of \(R\) is an \(I\)-prime hyperideal if for \(a, b \in R\) with \(ab \subseteq P-IP\) implies \(a \in P\) or \(b \in P\). We provide some characterizations of \(I\)-prime hyperideals.Mena, Ali Abdullah, Akray, Ismael
openaire +1 more source
Quasi-hyperideals in multiplicative hyperrings
A subring Q of a ring A is called a quasi-ideal of A if AQ intersection QA Q where AQ [QA] denotes the set of all finite sums of the form sigma aiqu[sigma qiai] where ai A and qi Q. Quasi-ideals are a generalization of left ideals and right ideals. Quasi-ideals in rings have long been studied and a lot of interesting theorems relating to quasi-ideals ...openaire +1 more source
Hyper-Parameter Tuning for Graph Kernels via Multiple Kernel Learning
2016Kernelized learning algorithms have seen a steady growth in popularity during the last decades. The procedure to estimate the performances of these kernels in real applications is typical computationally demanding due to the process of hyper-parameter selection. This is especially true for graph kernels, which are computationally quite expensive.
MASSIMO, CARLO MARIA +2 more
openaire +2 more sources