Results 41 to 50 of about 6,745,331 (273)

Solving the Closest Vector Problem with respect to l_p Norms

CoRR, 2011
In this paper, we present a deterministic algorithm for the closest vector problem for all l_p-norms, 1 < p < \infty, and all polyhedral norms, especially for the l_1-norm and the l_{\infty}-norm. We achieve our results by introducing a new lattice problem, the lattice membership problem.
Johannes Blömer, Stefanie Naewe
openaire   +2 more sources

Accelerating the B&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem

Croatian Operational Research Review, 2017
This paper presents a new branching rule based on the flatness of a polyhedron associated to the set of constraints in an integer linear programming problem. The rule called Flatness II is a heuristic technique used with the branch-and-bound method.
Ivan S. Derpich, Juan M. Sepúlveda
doaj   +1 more source

Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif, Diane Demailly, Gabriella A. Horvàth, Juan Dario Ortigoza Escobar, Nathalie Dorison, Mayté Castro Jiménez, Cécile A. Hubsch, Thomas Wirth, Gun‐Marie Hariz, Sophie Huby, Morgan Dornadic, Zohra Souei, Muhammad Mushhood Ur Rehman, Simone Hemm, Mehdi Boulaymen, Eduardo M. Moraud, Jocelyne Bloch, Xavier Vasques   +17 more
wiley   +1 more source

Unique Shortest Vector Problem for max norm is NP-hard [PDF]

, 2008
The unique Shortest vector problem (uSVP) in lattice theory plays a crucial role in many public-key cryptosystems. The security of those cryptosystems bases on the hardness of uSVP.
Nguyen Hong Tan, Than Quang Khoat
core   +1 more source

Bounds on quantum evolution complexity via lattice cryptography

SciPost Physics, 2022
We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators.
Ben Craps, Marine De Clerck, Oleg Evnin, Philip Hacker, Maxim Pavlov
doaj   +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

Improved Small Molecule Identification through Learning Combinations of Kernel Regression Models

Metabolites, 2019
In small molecule identification from tandem mass (MS/MS) spectra, input−output kernel regression (IOKR) currently provides the state-of-the-art combination of fast training and prediction and high identification rates.
Céline Brouard, Antoine Bassé, Florence d’Alché-Buc, Juho Rousu   +3 more
doaj   +1 more source

Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch

International Journal of Adaptive Control and Signal Processing, EarlyView.
This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane, Salama Makni, Mourad Kchaou, Ahmed El Hajjaji   +3 more
wiley   +1 more source

Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing [PDF]

, 2015
Improving on the Voronoi cell based techniques of [28, 24], we give a Las Vegas eO (2n) expected time and space algo- rithm for CVPP (the preprocessing version of the Closest Vector Problem, CVP).
Dadush, D.N. (Daniel), Bonifas, N.
core   +1 more source

A Hierarchical Key Assignment Scheme: A Unified Approach for Scalability and Efficiency

IEEE Access
This study introduces a hierarchical key assignment scheme (HKAS) based on the closest vector problem in an inner product space (CVP-IPS). The proposed scheme offers a comprehensive solution with scalability, flexibility, cost-effectiveness, and high ...
Ibrahim Celikbilek, Baris Celiktas, Enver Ozdemir   +2 more
doaj   +1 more source