搜索结果: 1-4 共查到“数理逻辑与数学基础 fast”相关记录4条 . 查询时间(0.109 秒)
Fast Solution of `1-norm Minimization Problems When the Solution May be Sparse
LASSO. LARS Homotopy Methods Basis Pursuit.
2015/8/21
The minimum `1-norm solution to an underdetermined system of linear equations y = Ax,
is often, remarkably, also the sparsest solution to that system. This sparsity-seeking property
is of interest i...
OPTIMAL AND FAST DETECTION OF SPATIAL CLUSTERS WITH SCAN STATISTICS
SPATIAL CLUSTERS SCAN STATISTICS
2015/8/20
We consider the detection of multivariate spatial clusters in the Bernoulli
model with N locations, where the design distribution has weakly dependent
marginals. The locations are scanned with a rec...
Building on recent work by Rippon and Stallard, we explore the intricate structure of the spider's web fast escaping sets associated with certain transcendental entire functions. Our results are expr...
Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
fast simple O(lg n) algorithm math
2010/11/24
Two very fast and simple O(lg n) algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A...