Fast computation of spatially adaptive kernel estimates
Sign Up to like & getrecommendations! Published in 2018 at "Statistics and Computing"
DOI: 10.1007/s11222-017-9772-4
Abstract: Kernel smoothing of spatial point data can often be improved using an adaptive, spatially varying bandwidth instead of a fixed bandwidth. However, computation with a varying bandwidth is much more demanding, especially when edge correction… read more here.
Keywords: spatially adaptive; adaptive kernel; computation spatially; computation ... See more keywords
Fast Computation of Tukey Trimmed Regions and Median in Dimension p > 2
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Computational and Graphical Statistics"
DOI: 10.1080/10618600.2018.1546595
Abstract: ABSTRACT Given data in , a Tukey κ-trimmed region is the set of all points that have at least Tukey depth κ w.r.t. the data. As they are visual, affine equivariant and robust, Tukey regions… read more here.
Keywords: trimmed regions; fast computation; computation tukey; tukey trimmed ... See more keywords
Fast computation of local minimal distances between CAD models for dynamics simulation
Sign Up to like & getrecommendations! Published in 2018 at "Computer-aided Design and Applications"
DOI: 10.1080/16864360.2017.1419646
Abstract: A complete framework for the fast computation of multiple local minimal distances between complex CAD models represented by their smooth boundaries without any tessellation is presented. It is used... read more here.
Keywords: minimal distances; fast computation; computation local; local minimal ... See more keywords
Fast computation of accessibility cones for assisting 3 + 2 axis milling
Sign Up to like & getrecommendations! Published in 2018 at "Computer-aided Design and Applications"
DOI: 10.1080/16864360.2018.1441234
Abstract: In this paper, we propose an algorithm for computing all appropriate cutter postures in the 3 + 2 axis milling of the mold part. As a measure of the appropriateness of the cutter posture, the peak ... read more here.
Keywords: axis milling; accessibility cones; cones assisting; assisting axis ... See more keywords
gMCS: fast computation of genetic minimal cut sets in large networks
Sign Up to like & getrecommendations! Published in 2019 at "Bioinformatics"
DOI: 10.1093/bioinformatics/bty656
Abstract: Motivation The identification of minimal gene knockout strategies to engineer metabolic systems constitutes one of the most relevant applications of the COnstraint‐Based Reconstruction and Analysis (COBRA) framework. In the last years, the minimal cut sets… read more here.
Keywords: computation genetic; gmcs fast; fast computation; minimal cut ... See more keywords
Fast Computation of Tight Funnels for Piecewise Polynomial Systems
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Control Systems Letters"
DOI: 10.1109/lcsys.2021.3134101
Abstract: Funnels are widely used in safety-critical applications such as robust motion planning as conservative bounds for possible state deviations due to disturbances. However, the problem of finding a tight funnel has been a challenging topic… read more here.
Keywords: problem; polynomial systems; fast computation; piecewise polynomial ... See more keywords
Fast computation of local displacement by stereo pairs
Sign Up to like & getrecommendations! Published in 2017 at "Pattern Recognition and Image Analysis"
DOI: 10.1134/s1054661817030063
Abstract: A new method for fast computation of the camera/robot local displacement (6 DOF) based on matched 3D point clouds obtained from images using computer vision methods is proposed. According to the method, the local geometric… read more here.
Keywords: local displacement; fast computation; computation local; displacement stereo ... See more keywords
Monotone and fast computation of Euler’s constant
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Inequalities and Applications"
DOI: 10.1186/s13660-017-1507-8
Abstract: We construct sequences of finite sums (l˜n)n≥0$(\tilde{l}_{n})_{n\geq 0}$ and (u˜n)n≥0$(\tilde{u}_{n})_{n\geq 0}$ converging increasingly and decreasingly, respectively, to the Euler-Mascheroni constant γ at the geometric rate 1/2. Such sequences are easy to compute and satisfy complete… read more here.
Keywords: fast computation; monotone fast; computation euler; euler constant ... See more keywords