Results 1 to 10 of about 113,995 (168)
Evaluating dimensionality reduction for genomic prediction
The development of genomic selection (GS) methods has allowed plant breeding programs to select favorable lines using genomic data before performing field trials.
Vamsi Manthena +8 more
doaj +1 more source
Gene regulation is orchestrated by a vast number of molecules, including transcription factors and co-factors, chromatin regulators, as well as epigenetic mechanisms, and it has been shown that transcriptional misregulation, e.g., caused by mutations in ...
Michael Banf, Thomas Hartwig
doaj +1 more source
Memory-Efficient Random Order Exponentiation Algorithm
Randomizing the execution of the sequence of operations in an algorithm is one of the most frequently considered solutions to improve the security of cryptographic implementations against sidechannel analysis.
Duc-Phong Le, Ali A. Ghorbani
doaj +1 more source
DYNAMIC AUTHORIZATION BASED ON THE HISTORY OF EVENTS [PDF]
The new paradigm in the field of access control systems with fuzzy authorization is proposed. Let there is a set of objects in a single data transmissionnetwork.
Maxim V. Baklanovsky, Arthur R. Khanov
doaj +1 more source
Cryptography and Algorithmic Randomness [PDF]
34 pages, LaTeX2e, no ...
Kohtaro Tadaki, Norihisa Doi
openaire +2 more sources
Quantum algorithmic randomness [PDF]
Quantum Martin-Löf randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz [J. Math. Phys. 60(9), 092201 (2019)]. We define a notion of quantum Solovay randomness, which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic result about approximating density matrices by subspaces.
openaire +2 more sources
On Application of the Ray-Shooting Method for LQR via Static-Output-Feedback
In this article we suggest a randomized algorithm for the LQR (Linear Quadratic Regulator) optimal-control problem via static-output-feedback. The suggested algorithm is based on the recently introduced randomized optimization method called the Ray ...
Yossi Peretz
doaj +1 more source
Matching solid shapes in arbitrary dimension via random sampling [PDF]
We give simple probabilistic algorithms that approximately maximize the volume of overlap of two solid, i.e. full-dimensional, shapes under translations and rigid motions. The shapes are subsets of $ℝ^d$ where $d≥ 2$.
Daria Schymura
doaj +1 more source
The Online Reservation Problem
Many sharing-economy platforms operate as follows. Owners list the availability of resources, prices, and contract-length limits. Customers propose contract start times and lengths. The owners decide immediately whether to accept or decline each proposal,
Shashank Goyal, Diwakar Gupta
doaj +1 more source
Novel and Efficient Randomized Algorithms for Feature Selection
Feature selection is a crucial problem in efficient machine learning, and it also greatly contributes to the explainability of machine-driven decisions. Methods, like decision trees and Least Absolute Shrinkage and Selection Operator (LASSO), can select ...
Zigeng Wang +2 more
doaj +1 more source

