搜索结果: 1-15 共查到“数学 algorithm”相关记录195条 . 查询时间(0.218 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:A 1.344-approximation algorithm for the vertex cover problem
顶点覆盖问题 1.344 近似算法
2023/12/11
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Analysis of distributed SG algorithm
分布式 SG算法 分析
2023/5/12
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Linear Convergence of a Primal-dual Algorithm for Multi-agent Interval Optimization
多智能体 区间优化 原对偶算法 线性收敛
2023/4/21
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Implementation of personalized optimization via the HEI algorithm
HEI算法 个性化 优化
2023/4/26
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Streaming algorithm for submodular cover problem
子模块化 覆盖问题 流算法
2023/5/15
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Distributed Event-Triggered Algorithm for Convex Optimization with Coupled Constraints
耦合约束凸优化 分布式事件 触发算法
2023/5/17
RESOLUTION ENHANCEMENT ALGORITHM FOR SPACEBORN SAR BASED ON HANNING FUNCTION WEIGHTED SIDELOBE SUPPRESSION
SAR image Sidelobe suppression Hunning function
2018/5/14
Resolution and sidelobe are mutual restrict for SAR image. Usually sidelobe suppression is based on resolution reduction. This paper provide a method for resolution enchancement using sidelobe opposit...
The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will...
A Nonlinear Reconstruction Algorithm from Absolute Value of Frame Coefficients for Low Redundancy Frames
Nonlinear Reconstruction Algorithm Absolute Value of Frame Coefficients Low Redundancy Frames
2015/9/29
In this paper we present a signal reconstruction algorithm from absolute value of frame coefficients that requires arelatively low redundancy. The basic idea is to use a nonlinear embedding of the inp...
The Metropolis algorithm is a widely used procedure for sampling
from a specified distribution on a large finite set. We survey what is
rigorously known about running times. This includes work from ...
The Spider Algorithm
Spider Algorithm
2015/8/26
One of the reasons complex analytic dynamics has been such a successful subject is the deep relation that has surfaced between conformal mapping, dynamics and combinatorics. The object of the spider a...
This brief paper introduces an algorithm for smooth interpolation of a
multivariate function. The input data for the algorithm consists of a set of function
values and derivatives up to order r on a...
We propose a sketch-based sampling algorithm, which effectively exploits the data sparsity. Sampling methods have become popular in large-scale data mining and information retrieval, where high data s...
L1-regularization path algorithm for generalized linear models
Generalized linear model Lasso Path algorithm Predictor–corrector method Regularization Variable selection
2015/8/21
We introduce a path following algorithm for L1-regularized generalized linear models. The L 1-regularization procedure is useful especially because it, in effect, selects variables according to the am...
Presence-Only Data and the EM Algorithm
Boosted trees EM algorithm Logistic model Presence-only data Use-availability data
2015/8/21
In ecological modeling of the habitat of a species, it can be prohibitively expensive to determine species absence.Presence-only data consist of a sample of locations with observed presences and a sep...