نتایج جستجو برای: pseudo time function
تعداد نتایج: 2925414 فیلتر نتایج به سال:
In this paper we present an interesting gadget based on the chain pair simplification problem under the discrete Fréchet distance (CPS-3F), which allows the construction of arbitrarily long paths that must be chosen in the simplification of the two curves. A pseudopolynomial time reduction from set partition is given as an example. For clarification, CPS-3F was recently shown to be in P, and th...
This note deals with the question: what remains of the Burkholder-Davis-Gundy inequalities when stopping times T are replaced by arbitrary random times ρ? We prove that these inequalities still hold when T is a pseudo-stopping time and never holds for ends of predictable sets.
We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random functions. Compared to previous results, which require a collision resistant hash function, our result provides significantly smaller signatures at the same security level. We also consider security in the strong sense and show...
This paper presents a method for generating neartime optimal trajectories in cluttered environments for manipulators wath invariant inertia matrices. For one obsdacle, the .methop generates the time-optimal trajectory b y manamatang the fame-deravatave of the return (cost) function for this problem, satisfying the HamiltonJacobi-Bellman (HJB) equation. For multiple obstacles, the trajectory i s...
this thesis is a study on insurance fraud in iran automobile insurance industry and explores the usage of expert linkage between un-supervised clustering and analytical hierarchy process(ahp), and renders the findings from applying these algorithms for automobile insurance claim fraud detection. the expert linkage determination objective function plan provides us with a way to determine whi...
In Machine Learning (ML) and Evolutionary Computation (EC), it is often beneficial to approximate a complicated function by a simpler one, such as a linear or quadratic function, for computational efficiency or feasibility reasons (cf. [Jin, 2005]). A complicated function (the target function in ML or the fitness function in EC) may require an exponential amount of computation to learn/evaluate...
Usually, empirical distribution functions are used to estimate the theoretical distribution function of known functions (X) of the observable random variable X. In practice, many researchers are using empirical distribution functions constructed from residuals, which are estimations of a non-observable error terms in linear models. This falls under a class of more general problems in which one ...
A simple but efficient method to improve readability of discrete pseudo time-frequency representations (TFRs) of nonstationary signals by the reassignment of the representations in discrete frequency dimension is presented. The method does not rely on the nonzero time derivative of the window function employed in the estimation of pseudo TFR. This property of the reassignment method is advantag...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید