Results 41 to 50 of about 6,692,580 (276)
A bit-capacity scaling algorithm for the constrained minimal cost network flow problem [PDF]
Network Biology, 2021 A polynomial time algorithm for solving the minimum-cost network flow problem has been proposed in this paper. This algorithm is mainly based on the binary representation of capacities; it solves the minimum-cost flow problem in directed graph of n nodes
Muhammad Tlas
doaj
A Linearithmic Time Algorithm for a Shortest Vector Problem in Compute-and-Forward Design
, 2016 We propose an algorithm with expected complexity of O(nlogn) arithmetic operations to solve a special shortest vector problem arising in computer-and-forward design, where n is the dimension of the channel vector.
Chang, Xiao-Wen, Wen, Jinming
core +4 more sources
Protocol for quantifying miRNA trafficking across the endosomal membrane
FEBS Open Bio, EarlyView.An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh +2 more
wiley +1 more source
Some Mathematical Problems Behind Lattice-Based Cryptography
CryptographyIn 1994, P. Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem. In 2007, D-Wave demonstrated the first quantum computer.
Chuanming Zong
doaj +1 more source
International Journal of Distributed Sensor Networks, 2022 Node localization is one of the key technologies in the wireless sensor network research field, which is crucial to the high-accuracy localization of mobile nodes, but the positioning error of traditional algorithms such as received signal strength ...
Lieping Zhang +4 more
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 +17 more
wiley +1 more source
dynoGP: Deep Gaussian Processes for Dynamic System Identification
International Journal of Adaptive Control and Signal Processing, EarlyView.This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli +3 more
wiley +1 more source
Efficient lattice Hamiltonian encoding for the shortest vector problem
Physical Review ResearchThe advent of quantum computing necessitates the transition of worldwide cryptosystems to postquantum cryptography (PQC), which is founded upon the problem of finding short vectors in high-dimensional structured lattices. It is assumed that the structure
Eden Schirman +2 more
doaj +1 more source
A Novel Compute-and-Forward Relaying Method for Multi-Antenna Wireless Relay Networks
Entropy, 2023 Compute-and-Forward (CoF) is an innovative physical layer network coding strategy, designed to enable receivers in wireless communications to effectively utilize interference.
Xuan Yang +4 more
doaj +1 more source
New Shortest Lattice Vector Problems of Polynomial Complexity
CoRR, 2014 The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be solved efficiently.
Saeid Sahraei, Michael C. Gastpar
openaire +2 more sources