Results 91 to 100 of about 4,174,426 (295)

Signature-Based Gr\"obner Basis Algorithms --- Extended MMM Algorithm for computing Gr\"obner bases [PDF]

, 2013
Signature-based algorithms is a popular kind of algorithms for computing Gr\"obner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a view of signature-
Sun, Yao
core  

Feedback Consolidation Algorithms for ABR Point-to-Multipoint Connections in ATM Networks

, 1998
ABR traffic management for point-to-multipoint connections controls the source rate to the minimum rate supported by all the branches of the multicast tree.
Fahmy, Sonia, Goyal, Rohit, Jain, Raj, Kalyanaraman, Shivkumar, Kota, Sastri, Samudra, Pradeep, Vandalore, Bobby   +6 more
core   +1 more source

Algorithms for media

Discrete Applied Mathematics, 2008
12 ...
David Eppstein, Jean-Claude Falmagne
openaire   +2 more sources

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, Adrián López García de Lomana, Thejus B. Venkatesh, Kritika Kirty, Snaevar Sigurdsson, Linda Vidarsdottir, Ramile Dilshat, Erla Sveinbjornsdottir, Snaedis Ragnarsdottir, Daniel H Magnusson, Maria R. Bustos, Eirikur Steingrimsson, Thorkell Gudjonsson, Stefan Sigurdsson   +13 more
wiley   +1 more source

Analyzing variational quantum landscapes with information content

npj Quantum Information
The parameters of the quantum circuit in a variational quantum algorithm induce a landscape that contains the relevant information regarding its optimization hardness.
Adrián Pérez-Salinas, Hao Wang, Xavier Bonet-Monroig   +2 more
doaj   +1 more source

Maximally-fast coarsening algorithms

, 2005
We present maximally-fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time-step $\Delta t=A t_s^{2/3}$.
Andrew D. Rutenberg, D. J. Eyre, Mowei Cheng   +2 more
core   +1 more source

A novel quinazolinone insulin receptor inhibitor and its synergy with an EGFR inhibitor in glucose‐driven glioblastoma

Molecular Oncology, EarlyView.
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka, Wioleta Cieślik, Wojciech Płaziński, Katarzyna Stępnik, Anna Boguszewska‐Czubara, Elżbieta Kot, Robert Musioł, Mateusz Jasica, Anna Mrozek‐Wilczkiewicz, Katarzyna Malarz   +9 more
wiley   +1 more source

Shadows of quantum machine learning

Nature Communications
Quantum machine learning is often highlighted as one of the most promising practical applications for which quantum computers could provide a computational advantage.
Sofiene Jerbi, Casper Gyurik, Simon C. Marshall, Riccardo Molteni, Vedran Dunjko   +4 more
doaj   +1 more source

Patient therapy outcome modeling in cancer organoids is improved by cancer‐associated fibroblasts and organoid assembly convolution

Molecular Oncology, EarlyView.
Patient‐derived organoids (PDOs) from pancreatic, colorectal, and gastric cancers were used to evaluate standard and experimental therapies. Incorporating cancer‐associated fibroblasts (CAFs) into organoid cultures improved patient therapy outcome prediction.
Marcin Grochowski, Liudmyla Dolinchuk, Michał Jerzak, Albert Gandurski, Tomasz Grochowski, Weronika Wojtyś, Maciej Zadrożny, Wojciech Kaźmierczak, Małgorzata Lenarcik, Marta Matejak‐Górska, Radosław Samsel, Tomasz Olesiński, Dawid Walerych   +12 more
wiley   +1 more source

Algorithmic Collusion is Algorithm Orchestration

CoRR
We propose a fresh `meta-game' perspective on the problem of algorithmic collusion in pricing games a la Bertrand. Economists have interpreted the fact that algorithms can learn to price collusively as tacit collusion. We argue instead that the co-parametrization of algorithms, in ways as are necessary to obtain algorithmic collusion, typically ...
Cesare Carissimo, Fryderyk Falniowski, Siavash Rahimi, Heinrich Nax   +3 more
openaire   +2 more sources