Results 211 to 220 of about 209,433 (256)
Molecular Oncology, EarlyView.High‐risk bladder cancer is typically treated with Bacillus Calmette‐Guérin (BCG), but 30–40% of patients relapse. No FDA‐ or CE‐approved biomarkers currently predict or prognosticate BCG failure. We systematically reviewed the literature and identified 72 eligible studies, revealing several promising biomarkers associated with BCG treatment response ...
Rui Ribeiro‐Pereira +7 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Combinatorics, Probability and Computing, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin Doerr, Anand Srivastav
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin Doerr, Anand Srivastav
openaire +1 more source
Discrepancies in discrepancy meetings: Results of the UK national discrepancy meeting survey
Clinical Radiology, 2014To present the findings of the UK national discrepancy meeting survey of radiology departments across England, Wales, Scotland, and Northern Ireland regarding the way in which discrepancy meetings are currently conducted. This is in the setting of impending changes required for revalidation.One hundred and fourteen (114) out of 195 (55%) of departments
S J, Prowse, B, Pinkey, R, Etherington
openaire +2 more sources
The discrepancy in discrepant analysis
The Lancet, 1996Discrepant analysis is a widely used technique that attempts to provide estimates of sensitivity and specificity in the presence of an imperfect gold-standard. This technique has been applied by many researchers to estimate the sensitivity and specificity of DNA-amplification tests for Chlamydia trachomatis such as the plasmid-based ligase chain ...
openaire +2 more sources
Proceedings of the ninth annual symposium on Computational geometry - SCG '93, 1993
We develop algorithms for computing the discrepancy of point sets in various Euclidean range spaces.
David P. Dobkin, David Eppstein
openaire +2 more sources
We develop algorithms for computing the discrepancy of point sets in various Euclidean range spaces.
David P. Dobkin, David Eppstein
openaire +2 more sources
Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets
Order, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul J. Tanenbaum +2 more
openaire +2 more sources
1998
Discrepancy theory is the study of irregularities of distributions. A typical question is: given a "complicated" distribution, find a "simple" one that approximates it well. As it turns out, many questions in complexity theory can be reduced to problems of that type.
openaire +2 more sources
Discrepancy theory is the study of irregularities of distributions. A typical question is: given a "complicated" distribution, find a "simple" one that approximates it well. As it turns out, many questions in complexity theory can be reduced to problems of that type.
openaire +2 more sources
Pediatric Clinics of North America, 1986
The proper management of LLD requires careful clinical and radiologic assessment, and repeated analysis of past growth in order to predict future growth. Treatment decisions must be re-evaluated constantly in the light of new leg length data and evolving surgical technique.
openaire +3 more sources
The proper management of LLD requires careful clinical and radiologic assessment, and repeated analysis of past growth in order to predict future growth. Treatment decisions must be re-evaluated constantly in the light of new leg length data and evolving surgical technique.
openaire +3 more sources
Linear Discrepancy and Bandwidth
Order, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter C. Fishburn +2 more
openaire +1 more source
Linear and Hereditary Discrepancy
Combinatorics, Probability and Computing, 2000Let A be an m × n matrix and q := [lfloor ]log2(m)[rfloor ]+1. In this article we improve the well-known bound lindisc(A) [les ] 2 herdisc(A) and show thatformula hereAs with the previous proofs relating to this problem, ours is constructive. We will give an on-line algorithm and analyse it using game theory.
openaire +3 more sources