Abstract: Whereas interior point methods provide polynomial-time linear programming algorithms, the running time bounds depend on bit-complexity or condition measures that can be unbounded in the ...
In this paper a new hybrid glowworm swarm algorithm (SAGSO) for solving structural optimization problems is presented. The structure proposed to be optimized here is a simply-supported concrete I-beam ...
The original version of this story appeared in Quanta Magazine. In 1939, upon arriving late to his statistics course at UC Berkeley, George Dantzig—a first-year graduate student—copied two problems ...
The leading approach to the simplex method, a widely used technique for balancing complex logistical constraints, can’t get any better. In 1939, upon arriving late to his statistics course at the ...
Despite the widespread success of neural networks, their susceptibility to adversarial examples remains a significant challenge. Adversarial training (AT) has emerged as an effective approach to ...
Copyright: © 2021 The Author(s). Published by Elsevier Ltd.
This article describes a non-parametric clustering algorithm with an outlier removal step. Our method is based on tools from topological data analysis: we define a new filtration on metric spaces ...
Abstract: Most blind hyperspectral unmixing methods exploit convex geometry properties of hyperspectral data. The minimum volume simplex analysis (MVSA) is one of such methods, which, as many others, ...
You can connect to the team via the app using "chat with the developers button" available when you have no conversations in the profile, "Send questions and ideas" in the app settings or via our ...
Single-cell multiomics sequencing techniques have rapidly developed in the past few years. Among these techniques, single-cell cellular indexing of transcriptomes and epitopes (CITE-seq) allows ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results