Results 91 to 100 of about 10,143,058 (320)

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer [PDF]

SIAM Review, 1995
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true
P. Shor
semanticscholar   +1 more source

Applicability of mitotic figure counting by deep learning: a development and pan‐cancer validation study

FEBS Open Bio, EarlyView.
In this study, we developed a deep learning method for mitotic figure counting in H&E‐stained whole‐slide images and evaluated its prognostic impact in 13 external validation cohorts from seven different cancer types. Patients with more mitotic figures per mm2 had significantly worse patient outcome in all the studied cancer types except colorectal ...
Joakim Kalsnes, Maria X. Isaksen, Frida Julbø, Manohar Pradhan, Andreas Kleppe, Sepp De Raedt, Ole‐Johan Skrede, Turid Torheim, John Arne Nesheim, Hans Martin Mohn, Hanne A. Askautrud, Karolina Cyll, Wanja Kildal, Emma Rewcastle, Melinda Lillesand, Vebjørn Kvikstad, Emiel Janssen, Robert Jones, Odd Terje Brustugun, Bjørn Brennhovd, Erik Skaaheim Haug, Lill‐Tove Rasmussen Busund, Elin Richardsen, Sigve Andersen, Tom Dønnem, Kristina Lindemann, Gunnar Kristensen, Neil A. Shepherd, Marco Novelli, Knut Liestøl, David Kerr, Håvard E. Danielsen, Tarjei S. Hveem   +32 more
wiley   +1 more source

Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?

Machine Learning and Knowledge Extraction, 2020
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem.
Joakim Linja, Joonas Hämäläinen, Paavo Nieminen, Tommi Kärkkäinen   +3 more
doaj   +1 more source

New bounds for truthful scheduling on two unrelated selfish machines

, 2019
We consider the minimum makespan problem for $n$ tasks and two unrelated parallel selfish machines. Let $R_n$ be the best approximation ratio of randomized monotone scale-free algorithms.
Kuryatnikova, Olga, Vera, Juan C.
core   +1 more source

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Finding Multiple Optimal Solutions to an Integer Linear Program by Random Perturbations of Its Objective Function

Algorithms
Integer linear programs (ILPs) and mixed integer programs (MIPs) often have multiple distinct optimal solutions, yet the widely used Gurobi optimization solver returns certain solutions at disproportionately high frequencies.
Noah Schulhof, Pattara Sukprasert, Eytan Ruppin, Samir Khuller, Alejandro A. Schäffer   +4 more
doaj   +1 more source

Algorithms with greedy heuristic procedures for mixture probability distribution separation [PDF]

Yugoslav Journal of Operations Research, 2019
For clustering problems based on the model of mixture probability distribution separation, we propose new Variable Neighbourhood Search algorithms (VNS) and evolutionary genetic algorithms (GA) with greedy agglomerative heuristic procedures and compare ...
Kazakovtsev Lev, Stashkov Dmitry, Gudyma Mikhail, Kazakovtsev Vladimir   +3 more
doaj   +1 more source

A new perspective on randomized gossip algorithms [PDF]

IEEE Global Conference on Signal and Information Processing, 2016
In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem.
Nicolas Loizou, Peter Richtárik
semanticscholar   +1 more source

Large‐scale bidirectional arrayed genetic screens identify OXR1 and EMC4 as modifiers of αSynuclein aggregation

FEBS Open Bio, EarlyView.
Activation of the mitochondrial protein OXR1 increases pSyn129 αSynuclein aggregation by lowering ATP levels and altering mitochondrial membrane potential, particularly in response to MSA‐derived fibrils. In contrast, ablation of the ER protein EMC4 enhances autophagic flux and lysosomal clearance, broadly reducing α‐synuclein aggregates.
Sandesh Neupane, Lea Nikolić, Lorenzo Maraio, Thomas Goiran, Nathan Karpilovsky, Stefano Sellitto, Vangelis Bouris, Jiang‐An Yin, Ronald Melki, Edward A Fon, Adriano Aguzzi, Elena De Cecco   +11 more
wiley   +1 more source

RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells

FEBS Open Bio, EarlyView.
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour, Christine Volmert, Valentina Piano   +2 more
wiley   +1 more source