Results 81 to 90 of about 742,132 (325)

Local Stochastic Approximation: A Unified View of Federated Learning and Distributed Multi-Task Reinforcement Learning Algorithms [PDF]

, 2020
Thinh T. Doan
openalex   +1 more source

Polarization‐resolved femtosecond Vis/IR spectroscopy tailored for resolving weak signals in biological samples using minimal sample volume

FEBS Open Bio, EarlyView.
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley   +1 more source

An approximation algorithm for the at least version of the generalized minimum spanning tree problem

Journal of Numerical Analysis and Approximation Theory, 2006
We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMSTP, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a ...
Petrică C. Pop, Andrei Horvat-Marc, Corina Pop Sitar   +2 more
doaj   +2 more sources

Approximation Properties of a Fractional Integral-Type Szász–Kantorovich–Stancu–Schurer Operator via Charlier Polynomials

Mathematics
The goal of this manuscript is to introduce a new Stancu generalization of the modified Szász–Kantorovich operator connecting Riemann–Liouville fractional operators via Charlier polynomials.
Nadeem Rao, Mohammad Farid, Nand Kishor Jha   +2 more
doaj   +1 more source

Truthful Mechanisms via Greedy Iterative Packing

, 2009
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare.
Chekuri, Chandra, Gamzu, Iftah
core   +2 more sources

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

FEBS Open Bio, EarlyView.
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li, Xi Xiao, Lingbin Qi, Chanyi Li, Sirui Song, Jiaying Qin, Zhigang Xue, Jinfeng Xue, Huaifang Li   +8 more
wiley   +1 more source

Pass-Efficient Randomized LU Algorithms for Computing Low-Rank Matrix Approximation [PDF]

, 2020
Bolong Zhang, Michael Mascagni
openalex   +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

Szász–Beta Operators Linking Frobenius–Euler–Simsek-Type Polynomials

Axioms
This manuscript associates with a study of Frobenius–Euler–Simsek-type Polynomials. In this research work, we construct a new sequence of Szász–Beta type operators via Frobenius–Euler–Simsek-type Polynomials to discuss approximation properties for the ...
Nadeem Rao, Mohammad Farid, Shivani Bansal   +2 more
doaj   +1 more source

A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs [PDF]

, 2012
Kolla and Tulsiani [KT07,Kolla11} and Arora, Barak and Steurer [ABS10] introduced the technique of subspace enumeration, which gives approximation algorithms for graph problems such as unique games and small set expansion; the running time of such ...
Gharan, Shayan Oveis, Trevisan, Luca
core