搜索结果: 1-15 共查到“Approximating”相关记录34条 . 查询时间(0.119 秒)
Approximating Private Set Union/Intersection Cardinality with Logarithmic Complexity
Private Set Union Cardinality Private Set Intersection Cardinality Privacy Preserving Data Mining
2018/5/28
The computation of private set union/intersection cardinality (PSU-CA/PSI-CA) is one of the most intensively studied problems in Privacy Preserving Data Mining (PPDM). However, existing protocols are ...
A Fully Polynomial Approximation Scheme for Approximating a Sum of Random Variables
Threshold probability Tail probability Approximate counting Counting knapsack FPTAS
2016/1/22
Given n independent integer-valued random variables X 1 , X 2 ,..., X n and an integer C, we study the fundamental problem of computing the probability that the sum X = X 1 + X 2 +···+ X n is at most ...
Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
Approximating Expected Values Combinatorial Optimization Problems Stochastic Points
2016/1/22
We consider the stochastic geometry model where the location of each node is a random point in a given metric space,or the existence of each node is uncertain. We study the problem-s of computing the ...
Approximating LIDAR Ground Elevation Data by Higher-Order Tensor-Product B-Splines
DEM/DTM LIDAR Surface Modelling Reconstruction GIS
2015/12/8
We consider, in this paper, the problem of reconstructing the surface from LIDAR ground elevations. We reconstruct the surface by first rotating the LIDAR scan-lines so that they are parallel to the Y...
APPROXIMATING PHOTON RECOLLISION PROBABILITY IN VEGETATION CANOPIES
vegetation canopies predicting remotely s
2015/9/8
To be applicable to a wide variety of biomes, algorithms for predicting remotely sensed signatures of forests
have to rely on physically-based principles. These physically-based models are able to ca...
The task of constructing higher-dimensional invariant manifolds for dynamical systems can
be computationally expensive. We demonstrate that this problem can be locally reduced to
solving a system of...
MONTE CARLO SAMPLING IN DUAL SPACE FOR APPROXIMATING THE EMPIRICAL HALFSPACE DISTANCE
SPACE FOR APPROXIMATING EMPIRICAL HALFSPACE DISTANCE
2015/8/20
The Kolmogorov]Smirnov distance is an important tool for constructing confidence sets and tests in univariate problems. In multivariate
settings, an analogous role is played by the halfspace di...
Fading memory and the problem of approximating nonlinear operators with Volterra series
Continuous nonlinear operator volterra series operator nonlinear dynamic system
2015/8/13
Using the notion of fading memory, very strong versions of two theorems are proved. The first is that any time-invariant (TI) continuous nonlinear operator can be approximated by a Volterra series ope...
Approximating Martingales for Variance Reduction in Markov Process Simulation
Variance reduction Markov process simulation martingale
2015/7/8
“Knowledge of either analytical or numerical approximations should enable more efficient simulation estimators to be constructed.” This principle seems intuitively plausible and certainly attractive, ...
GAPPARD: a computationally efficient method of approximating gap-scale disturbance in vegetation models
GAPPARD computationally efficient method approximating gap-scale disturbance vegetation models
2014/12/12
Models of vegetation dynamics that are designed for application at spatial scales larger than individual forest gaps suffer from several limitations. Typically, either a population average approximati...
Maintaining an Optimal Flow of Forest Products under a Carbon Market: Approximating a Pareto Set of Optimal Silvicultural Regimes for Eucalyptus fastigata
Optimal Control Competitive Co-Evolutionary Multi-Objective Genetic Algorithm (cc-MOGA) Pareto Front Forest Holding Value Kruskal-Wallis Test Multiple Comparison Procedure
2013/3/4
A competitive co-evolutionary Multi-Objective Genetic Algorithm (cc-MOGA) was used to approximate a Pareto front of efficient silvicultural regimes for Eucalyptus fastigata. The three objectives to be...
Approximating stochastic volatility by recombinant trees
American options stochastic volatility Heston model correlated random walk
2012/6/5
A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting...
On Approximating D-induced Polar Sets Of
Robust optimization Polyhedral approximation Second-order cone representable
2011/9/29
This article investigates approximatively describe the set F = {[Ao,...,An ] |An+∑si,Ai ∈ K,∨s ∈ U where K is a geometric cone while $\mathcal{U}$ is an ellipsoid. The idea of approximation of a secon...
The Odd-Point Ternary Approximating Schemes
Approximating Subdivision Scheme Derivative Continuity Smoothness Convergence Shape Parameters and Laurent Polynomial
2013/1/30
We present a general formula to generate the family of odd-point ternary approximating subdivision schemes with a shape parameter for describing curves. The influence of parameter to the limit curves ...
Approximating European Options by Rebate Barrier Options
European options Financial bubbles Local martingales Truncation approximation Convergence rate Barrier options
2011/3/23
When the underlying stock price is a strict local martingale process under an equivalent local martingale measure, Black-Scholes PDE associated with an European option may have multiple solutions. In ...