Results 51 to 60 of about 11,198,718 (212)
Synchronizing transportation of people with reduced mobility through airport terminals [PDF]
Navigating through an airport is easy enough for most passengers, but when you are reduced in mobility it is a different story. In this paper we look at an airport at which between 300 and 500 Passengers with Reduced Mobility (PRMs) arrive daily, who ...
van den Akker, J.M. +4 more
core
Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols
Public key cryptography protocols, such as RSA and elliptic curve cryptography, will be rendered insecure by Shor’s algorithm when large-scale quantum computers are built.
Utsav Banerjee +2 more
doaj +1 more source
Systemic sclerosis (SSc) is a rare autoimmune disease defined by immune dysregulation, vasculopathy, and progressive fibrosis of the skin and internal organs. Despite advances in care, major complications such as interstitial lung disease (ILD) and myocardial involvement remain the leading causes of morbidity and mortality.
Cristiana Sieiro Santos +2 more
wiley +1 more source
Veilige en efficiënte inspectie van het spoor [PDF]
Met het project ‘Veilige en efficiënte inspectie van het spoor’ wonnen de bedrijven Inspectation1 en en CQM2 de Hendrik Lorentz Prijs3 . In dit project wordt onder meer deep-learningtechniek intelligent ingezet in combinatie met visualisatietechnieken ...
van den Broek, Huub +3 more
core
Integrated NTT-Karatsuba for fast multiplication of NTRU Algorithm
The increasing threat of attacks from quantum computers requires the development of more efficient and secure post-quantum cryptographic algorithms, one of which is NTRU.
Muhammad Fathan Rivaldi +2 more
doaj +1 more source
The true cost of factoring: Linking magic and number-theoretic complexity in Shor's algorithm
The execution cost of quantum algorithms is typically quantified through asymptotic gate counts and qubit register sizes, yet these metrics do not directly capture which genuinely quantum resources, and in what amount, must be created and maintained for the computation to succeed. The systematic quantification of such information-theoretic requirements
Paviglianiti, Alessio +3 more
openaire +2 more sources
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Practical divide-and-conquer algorithms for polynomial arithmetic [PDF]
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for composition of power series, showing that it can be applied practically to ...
Andrew Novocin +4 more
core +1 more source
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices [PDF]
We survey a number of recent results that relate the fine-grained complexity of several NP-Hard problems with the rank of certain matrices. The main technical theme is that for a wide variety of Divide & Conquer algorithms, structural insights on ...
Nederlof, Jesper +5 more
core +1 more source
Beyond boson sampling: higher spin sampling as a practical path to quantum supremacy
Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage.
Chon-Fai Kam, En-Jui Kuo
doaj +1 more source

