نتایج جستجو برای: parametric generator of k
تعداد نتایج: 21211407 فیلتر نتایج به سال:
We consider nite lattice packings C n + K of n copies of some centrally symmetric convex body K in E d for large n. Assume that C n is a subset of a lattice , and % is at least the covering radius; namely, + %K covers the space. The parametric density (C n ; %) is deened by (C n ; %) = n V (K)=V (conv C n + %K). We show that if (C n ; %) is minimal for n large then the shape of conv C n is appr...
This paper presents multiple LUT cascade to realize an address generator that produces unique addresses ranging from 1 to k for k distinct input vectors. We implemented six kinds of address generators using multiple LUT cascades, Xilinx’s CAM (Xilinx IP core), and an address generator using registers and gates on Xilinx Spartan-3 FPGAs. One of our implementations has 76% more throughput, 29.5 t...
We prove an O(n(k + 1)1/3) upper bound for planar k-sets. This is the first considerable improvement on this bound after its early solution approximately 27 years ago. Our proof technique also applies to improve the current bounds on the combinatorial complexities of k-levels in the arrangement of line segments, k convex polygons in the union of n lines, parametric minimum spanning trees, and p...
Using a large sample of D+ → K−K+π+ decays collected by the FOCUS photoproduction experiment at Fermilab, we present the first non-parametric analysis of the K−π+ amplitudes in D+ → K−K+π+ decay. The technique is similar to the technique used for our non-parametric measurements of the D+ → K ∗0 e+ν form factors. Although these results are in rough agreement with those of E687, we observe a wide...
background : kernel smoothing method is a non-parametric or graphical method for statistical estimation. in the present study was used a kernel smoothing method for finding the death hazard rates of patients with acute myocardial infarction. methods : by employing non-parametric regression methods, the curve estimation, may have some complexity. in this article, four indices of epanechnikov, b...
We consider two general frameworks for multiple domination, which are called 〈r, s〉-domination and parametric domination. They generalise and unify {k}-domination, k-domination, total k-domination and k-tuple domination. In this paper, known upper bounds for the classical domination are generalised for the 〈r, s〉-domination and parametric domination numbers. These generalisations are based on t...
While it is known how to generate satisfiable instances by reducing certain computational problems to SAT, it is not known how a similar generator can be developed directly for k-SAT. In this work we almost answer this question affirmatively by improving upon previous results in many ways. First, we give a generator for instances of MAX k-SAT, the version of k-SAT where one wants to maximize th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید