Results 31 to 40 of about 6,692,580 (276)
Complexity of the Transshipment Problem with a Permutable Transit Vector
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2010 In this paper, we show that the transshipment problem with a permutable transit vector remains NP-hard even when each entry of the given transit vector takes either zero or two. We prove the hardness by a reduction from an NP-complete problem by the name
Yoshiyuki KARUNO +2 more
doaj +1 more source
Low Complexity Coefficient Selection Algorithms for Compute-and-Forward
IEEE Access, 2017 Compute-and-forward (C&F) has been proposed as an efficient strategy to reduce the backhaul load for distributed antenna systems. Finding the optimal coefficients in C&F has commonly been treated as a shortest vector problem, which is NP-hard ...
Qinhui Huang, Alister Burr
doaj +1 more source
Optimized Voronoi-Based Algorithms for Parallel Shortest Vector Computation [PDF]
, 2022 This chapter addresses Voronoi cell-based algorithms, solving the Shortest Vector Problem, a fundamental challenge in lattice-based cryptanalysis. Several optimizations reduce the original algorithm's execution time.
Artur Mariano +7 more
core +1 more source
Using the binary representation of arc capacity in a polynomial time algorithm for the constrained maximum flow problem in directed networks [PDF]
Network Biology, 2022 In this paper, the binary representation of arc capacity has been used in developing an efficient polynomial time algorithm for the constrained maximum flow problem in directed networks.
Muhammad Tlas
doaj
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle [PDF]
, 2011 We give a polynomial time Turing reduction from the $γ^2\sqrt{n}$-approximate closest vector problem on a lattice of dimension $n$ to a $γ$-approximate oracle for the shortest vector problem. This is an improvement over a reduction by Kannan, which achieved $γ^2n^{3/2}$.
Dubey Chandan, Holenstein Thomas
openaire +3 more sources
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem [PDF]
, 2008 We construct public-key cryptosystems that are secure assuming the \emph{worst-case} hardness of approximating the length of a shortest nonzero vector in an $n$-dimensional lattice to within a small $\poly(n)$ factor. Prior cryptosystems with worst-case
Chris Peikert
core +3 more sources
A new fuzzy support vector machine with pinball loss
Discover Artificial Intelligence, 2023 The fuzzy support vector machine (FSVM) assigns each sample a fuzzy membership value based on its relevance, making it less sensitive to noise or outliers in the data.
Ram Nayan Verma +4 more
doaj +1 more source
New practical algorithms for the approximate shortest lattice vector [PDF]
, 2005 We present a practical algorithm that given an LLL-reduced lattice basis of dimension n, runs in time O(n3(k=6)k=4+n4) and approximates the length of the shortest, non-zero lattice vector to within a factor (k=6)n=(2k). This result is based on reasonable
Schnorr, Claus Peter
core
Finding novel vulnerabilities of hypomorphic BRCA1 alleles
Molecular Oncology, EarlyView.Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder +10 more
wiley +1 more source
MITF maintains genome stability in nonmelanocyte lineages
Molecular Oncology, EarlyView.MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir +13 more
wiley +1 more source