Results 61 to 70 of about 4,116,478 (294)
Soft document clustering using a novel graph covering approach
BioData Mining, 2018 Background In text mining, document clustering describes the efforts to assign unstructured documents to clusters, which in turn usually refer to topics. Clustering is widely used in science for data retrieval and organisation.
Jens Dörpinghaus +2 more
doaj +1 more source
, 2012 Consider the problem when we want to construct some structure on a bounded degree graph, e.g. an almost maximum matching, and we want to decide about each edge depending only on its constant radius neighbourhood.
Csóka, Endre
core
Non-Local Probes Do Not Help with Graph Problems
, 2015 This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computing (e.g., parallel decision trees or centralised local algorithms) seem to
Göös, Mika +4 more
core +1 more source
Molecular Oncology, EarlyView.Meta‐transcriptome analysis identified FGF19 as a peptide enteroendocrine hormone associated with colorectal cancer prognosis. In vivo xenograft models showed release of FGF19 into the blood at levels that correlated with tumor volumes. Tumoral‐FGF19 altered murine liver metabolism through FGFR4, thereby reducing bile acid synthesis and increasing ...
Jordan M. Beardsley +5 more
wiley +1 more source
KOALA GRAPH THEORY INTERNET SERVICE
TASK Quarterly, 2015 KOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discrete optimization.
TOMASZ GOLUCH +2 more
doaj +1 more source
Analysis of an algorithm catching elephants on the Internet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 The paper deals with the problem of catching the elephants in the Internet traffic. The aim is to investigate an algorithm proposed by Azzana based on a multistage Bloom filter, with a refreshment mechanism (called $\textit{shift}$ in the present paper),
Yousra Chabchoub +3 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 +2 more
core +1 more source
Algorithms, Algorithms, Algorithms [PDF]
Computer, 2020 James Bret Michael, Jeffrey Voas
openaire +1 more source
Molecular Oncology, EarlyView.This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns +10 more
wiley +1 more source
Variational quantum generative modeling by sampling expectation values of tunable observables
npj Quantum InformationExpectation Value Samplers (EVSs) are quantum generative models that can learn high-dimensional continuous distributions by measuring the expectation values of parameterized quantum circuits. However, these models can demand impractical quantum resources
Kevin Shen +5 more
doaj +1 more source