نتایج جستجو برای: smooth cost functions
تعداد نتایج: 967405 فیلتر نتایج به سال:
The Sauer-Shelah lemma has been instrumental in the analysis of algorithms in many areas including learning theory, combinatorial geometry, graph theory. Algorithms over discrete structures, for instance, sets of Boolean functions, often involve a search over a constrained subset which satisfies some properties. In this paper we study the complexity of classes of functions h of finite VCdimensi...
THEOREM 1.1 (U. Sattes). Let r > 2 and g E C[O, l]\B$,‘. Then f”EB$’ is a best approximation to g, in L” (such a best approximation necessari/J) exisrs) if and only if there exists a subinterual (a, /?) c IO. 1 I and a positilse integer M > r + 1 for which the following conditions hold (i) f”l,n.ll, is a Perfect spline of degree r with exactly) M ~ r -1 knots arzd I.f”““(s)l = I a. e. on [u,pI....
Abstract The Reeb space of a continuous function is the connected components level sets. In this paper, we first prove that smooth on closed manifold with finitely many critical values has structure finite graph without loops. We also show an arbitrary loops can be realized as certain values, where corresponding sets preassigned. Finally, map to induces epimorphism between fundamental groups id...
A new quark-field smearing algorithm is defined which enables efficient calculations of a broad range of hadron correlation functions. The technique applies a low-rank operator to define smooth fields that are to be used in hadron creation operators. The resulting space of smooth fields is small enough that all elements of the reduced quark propagator can be computed exactly at reasonable compu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید