Results 61 to 70 of about 196,243 (311)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survival after relapse in pediatric acute myeloid leukemia (AML) remains poor, highlighting the critical importance of identifying prognostic factors to guide optimal relapse management. Methods We investigated the prognostic impact of multiparameter flow cytometry (MFC) measurable residual disease (MRD) in 188 patients with first ...
Camilla Poulsen +21 more
wiley +1 more source
Ranking Function Adaptation with Boosting Trees [PDF]
, 2011 Machine-learned ranking functions have shown successes in Web search engines. With the increasing demands on developing effective ranking functions for different search domains, we have seen a big bottleneck, that is, the problem of insufficient labeled ...
Keke Chen +5 more
core +1 more source
Solving Fully Fuzzy Linear Programming Problems with Zero-One Variables by Ranking Function [PDF]
Control and Optimization in Applied Mathematics, 2016 Jahanshahloo has suggested a method for the solving linear programming problems with zero-one variables. In this paper we formulate fully fuzzy linear programming problems with zero-one variables and a method for solving these problems is presented using
Aminalah Alba
doaj
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Despite 5‐year survival rates of over 90% among children and adolescents/young adults (CAYAs) with classic Hodgkin lymphoma (cHL), 15%–20% relapse after frontline therapy. Prior analysis of frontline Children's Oncology Group (COG) clinical trials demonstrated that, despite similar rates of relapse, non‐Hispanic Black (NHB) and ...
Mallorie B. Heneghan +14 more
wiley +1 more source
Trada: Tree Based Ranking Function Adaptation [PDF]
, 2008 Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, we have seen a big bottleneck, i.e., the problem of insufficient training ...
Tseng, Belle +11 more
core +1 more source
, 2009 Ranking functions have been introduced under the name of ordinal conditional functions in Spohn (1988; 1990). They are representations of epistemic states and their dynamics. The most comprehensive and up to date presentation is Spohn (manuscript).
openaire +2 more sources
Rank functions of closure spaces of finite rank
Discrete Mathematics, 1984 A closure space \((S,)\) consists of a set S together with a closure operator \(\). In such a space, the set X is closed if \(=X\) while the rank \(\rho\) (A) of a closed set A is the maximum length r of a chain of closed sets \(A_ i\) such that \(A_ 0\varsubsetneq A_ 1\varsubsetneq...\varsubsetneq A_ r=A\) where, if this maximum does not exist, \(\rho\
openaire +1 more source
On Multiphase-Linear Ranking Functions [PDF]
, 2017 typos ...
Amir M. Ben-Amram, Samir Genaim
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An earlier study on children diagnosed with acute lymphoblastic leukemia (ALL) at Moi Teaching and Referral Hospital (MTRH) in Kenya reported a low event‐free survival (EFS), excess treatment abandonment, and high induction mortality.
Gilbert Olbara +7 more
wiley +1 more source
Automatic Verification of Counter Systems With Ranking Function [PDF]
, 2009 The verification of final termination for counter systems is undecidable. For non flattable counter systems, the verification of this type of property is generally based on the exhibition of a ranking function. Proving the existence of a ranking function
Encrenaz, Emmanuelle, Finkel, Alain
core +1 more source