Results 31 to 40 of about 1,423,546 (286)
Bounds on the Signed 2-Independence Number in Graphs
Discussiones Mathematicae Graph Theory, 2013 Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G.
Volkmann Lutz
doaj +1 more source
On the Efficiency of Classical and Quantum Secure Function Evaluation
, 2014 We provide bounds on the efficiency of secure one-sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case.
Winkler, Severin, Wullschleger, Jürg
core +1 more source
Improving bounds on packing densities of 4-point permutations
, 2018 We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342.
Sliacan, Jakub, Stromquist, Walter
core +1 more source
Clinical Insights Into Hypercalcemia of Malignancy in Childhood
Pediatric Blood &Cancer, EarlyView.ABSTRACT Hypercalcemia of malignancy (HCM) is a rare but life‐threatening metabolic emergency in children that occurs in less than 1% of pediatric cancer cases, with a reported incidence ranging from 0.4% to 1.0% across different studies. While it is observed in 10%–20% of adult malignancies, pediatric HCM remains relatively uncommon.
Hüseyin Anıl Korkmaz
wiley +1 more source
Journal of Artificial Intelligence Research, 2003 In this article we present an algorithm to compute bounds on the marginals of a graphical model. For several small clusters of nodes upper and lower bounds on the marginal values are computed independently of the rest of the network. The range of allowed probability distributions over the surrounding nodes is restricted using earlier computed bounds.
Leisink, M., Kappen, B.
openaire +4 more sources
Bounded underapproximations [PDF]
Formal Methods in System Design, 2010 We show a new and constructive proof of the following language-theoretic result: for every context-free language L, there is a bounded context-free language L' included in L which has the same Parikh (commutative) image as L. Bounded languages, introduced by Ginsburg and Spanier, are subsets of regular languages of the form w1*w2*...wk* for some finite
Ganty, Pierre +2 more
openaire +6 more sources
A collection of seminorms linking the
MathematicsWe investigate a novel operator seminorm, QA,mλ,f, for an A-bounded operator Q, where A is a positive operator on a complex Hilbert space (K,⟨·,·⟩).
Salma Aljawi, Kais Feki, Zakaria Taki
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács +8 more
wiley +1 more source
ROC and the bounds on tail probabilities via theorems of Dubins and F. Riesz
, 2009 For independent $X$ and $Y$ in the inequality $P(X\leq Y+\mu)$, we give sharp lower bounds for unimodal distributions having finite variance, and sharp upper bounds assuming symmetric densities bounded by a finite constant.
Clarkson, Eric +2 more
core +1 more source
Intravitreal GD2‐Specific Chimeric Antigen Receptor T‐Cell Therapy for Refractory Retinoblastoma
Pediatric Blood &Cancer, EarlyView.ABSTRACT Effective treatments for advanced, treatment‐resistant retinoblastoma (RB) remain limited. GD2‐specific chimeric antigen receptor (CAR) T cells show potent antitumor activity with minimal toxicity but have not previously been evaluated in RB.
Subongkoch Subhadhirasakul +13 more
wiley +1 more source