Results 271 to 280 of about 2,644,664 (312)

Predicting poor response to anti-osteoporosis therapy: a machine learning model integrating clinical and novel biomarker data. [PDF]

Front Med (Lausanne)
Bi Y, Zhang M, Zhang W, Li J.
europepmc   +1 more source

M2 macrophage-associated factors for constructing a prognostic model for osteosarcoma. [PDF]

Medicine (Baltimore)
Han J.
europepmc   +1 more source

Generative adversarial networks-based Image-to-Image translation allows tumor consistency prediction from standard MR images in pituitary adenomas. [PDF]

PLOS Digit Health
Wu G, Yao S, Liu X, Rui W, Xu H, Ma Z, Wang Y, Yao Z, Chen G, Guo Y, He H, Qiao N, Yu J, Zhao Y.   +13 more
europepmc   +1 more source

Govt to set up independent regulator to oversee gambling industry.

, 2019

core  

Some of the next articles are maybe not open access.

Related searches:

On Dominating Sets and Independent Sets of Graphs

Combinatorics, Probability and Computing, 1999
For a graph G on vertex set V = {1, …, n} let k = (k1, …, kn) be an integral vector such that 1 [les ] ki [les ] di for i ∈ V, where di is the degree of the vertex i in G. A k-dominating set is a set Dk ⊆ V such that every vertex i ∈ V[setmn ]Dk has at least ki neighbours in Dk.
Jochen Harant, Anja Pruchnewski, Margit Voigt   +2 more
openaire   +3 more sources

Convexly independent sets

Combinatorica, 1990
A family of pairwise disjoint compact convex sets is called convexly independent, if none of its members is contained in the convex hull of the union of the other members of the family. The main result of the paper gives an upper bound for the maximum cardinalityh(k, n) of a family ℱ of mutually disjoint compact convex sets such that any subfamily of ...
Tibor Bisztriczky, Gábor Fejes Tóth
openaire   +1 more source

Independent Gödel sentences and independent sets

Journal of Symbolic Logic, 1975
In this paper we investigate some of the recursion-theoretic problems which are suggested by the logical notion of independence.A set S of natural numbers will be said to be k-independent (respectively, ∞-independent) if, roughly speaking, in every correct system there is a k-element set (respectively, an infinite set) of independent true sentences of ...
A. M. Dawes, John B. Florence
openaire   +2 more sources

On covering an independent set in a grid with a second independent set

Journal of Graph Theory, 1996
It is shown that for every independent set \(X\) in an \(n \times m\) grid, \(n,m>1\), there is a second independent set \(Y\) such that every member of \(X\) is adjacent to at least one member of \(Y\). The proof gives a construction of \(Y\). This is equivalent to showing that every maximal independent set in a grid has a second, disjoint, maximal ...
openaire   +2 more sources

Stochastic Independence in a Coherent Setting

Annals of Mathematics and Artificial Intelligence, 2002
The authors continue their systematic study of coherent assessment of (finitely additive) probability to a family of conditional events. They start with a nice exposition of the concept of coherent assessment and then thoroughly study the stochastic independence in the framework of coherent probability theory.
COLETTI, Giulianella, Scozzafava R.
openaire   +3 more sources

On Edge-Independent Sets

2013
A set of edges in a graph G is independent if no two elements are contained in a clique of G. The edge-independent set problem asks for the maximal cardinality of independent sets of edges. We show that the edge-clique graphs of cocktail parties have unbounded rankwidth.
Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon   +2 more
openaire   +1 more source