Results 51 to 60 of about 33,182 (260)

Integrated NTT-Karatsuba for fast multiplication of NTRU Algorithm

JITeCS (Journal of Information Technology and Computer Science)
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, Rohmat Gunawan, Irani Hoeronis   +2 more
doaj   +1 more source

Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols

Transactions on Cryptographic Hardware and Embedded Systems, 2019
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, Tenzin S. Ukyab, Anantha P. Chandrakasan   +2 more
doaj   +1 more source

Artificial Intelligence in Systemic Sclerosis: Clinical Applications, Challenges, and Future Directions

Arthritis Care &Research, EarlyView.
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, José Miguel Sequí‐Sabater, Diego Benavent   +2 more
wiley   +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, Seclì, Matteo, Tirrito, Emanuele, Savona, Vincenzo   +3 more
openaire   +2 more sources

Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]

, 2009
We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej,, Lingas, Andrzej, Artur Czumaj, Czumaj, Artur, Andrzej Lingas   +4 more
core   +1 more source

A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems

International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.
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, Anthony Siming Chen, Guido Herrmann   +2 more
wiley   +1 more source

Beyond boson sampling: higher spin sampling as a practical path to quantum supremacy

npj Quantum Information
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

A comparative study of game theoretic and evolutionary models for software agents

, 2004
Most of the existing work in the study of bargaining behaviour uses techniques from game theory. Game theoretic models for bargaining assume that players are perfectly rational and that this rationality in common knowledge.
Shaheen S. Fatima, Nicholas R. Jennings, Fatima, S., Michael Wooldridge, Jennings, NR, Jennings, N.R., Wooldridge, M, Wooldridge, M., Fatima, S   +8 more
core   +1 more source

Fragile Complexity of Comparison-Based Algorithms [PDF]

, 2019
We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes part in.
Jacob, Riko, Afshani, Peyman, Penschuck, Manuel, Bender, Michael A., Sitchinava, Nodari, Meyer, Ulrich, Fagerberg, Rolf, Hammer, David Mortan Grøne, Herman, Grzegorz, Jacob, Riko; id_orcid, Penschuck, Manuel; id_orcid, Kostitsyna, Irina, Svensson, Ola, Hammer, David, Sitchinavaz, Nodari, Kostitsyna, I Irina   +15 more
core   +1 more source

Adaptive Observer for Coupled Wave PDE and Infinite ODE With Sampled Data and Unknown Input: Application to Brain Hemodynamics Estimation

International Journal of Adaptive Control and Signal Processing, EarlyView.
This article proposes a convergent adaptive observer for a damped wave PDE and an infinite‐dimensional ODE coupled in cascade using sampled‐in‐space ODE state measurements. The proposed observer estimates the distributed states of the PDE and ODE along with unknown PDE parameters and spatial input.
Zehor Belkhatir, Sarah Mechhoud, Taous‐Meriem Laleg‐Kirati   +2 more
wiley   +1 more source