نتایج جستجو برای: dp
تعداد نتایج: 13317 فیلتر نتایج به سال:
For any graph G , the chromatic polynomial of is function P ( m ) which counts number proper -colorings for each positive integer . The DP color D introduced by Kaul and Mudrock in 2019, a generalization with ? Let ? (resp. < denote property that = holds sufficiently large integers It an interesting problem finding graphs holds. showed if has even girth, then Thomason recently proved dominating...
In Lorentzian manifolds of any dimension the concept of causal tensors is introduced. Causal tensors have positivity properties analogous to the so-called “dominant energy condition”. Further, it is shown how to build, from any given tensor A, a new tensor quadratic in A and “positive”, in the sense that it is causal. These tensors are called superenergy tensors due to historical reasons becaus...
The time memory trade-off (TMTO) algorithm, first introduced by Hellman, is a method for quickly inverting a one-way function, using pre-computed tables. The distinguished point method (DP) is a technique that reduces the number of table lookups performed by Hellman’s algorithm. In this paper we propose a new variant of the DP technique, named variable DP (VDP), having properties very different...
Among the various cardiac contractility parameters, left ventricular (LV) ejection fraction (EF) and maximum dP/dt (dP/dt(max)) are the simplest and most used. However, these parameters are often reported together, and it is not clear if they are complementary or redundant. We sought to compare the discriminative value of EF and dP/dt(max) in assessing systolic dysfunction after myocardial infa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید