搜索结果: 1-8 共查到“数学基础 algorithms”相关记录8条 . 查询时间(0.279 秒)
On characterizations of Metropolis type algorithms in continuous time
Metropolitan type algorithm personality traits
2015/7/7
On characterizations of Metropolis type algorithms in continuous time。
Gibbs/Metropolis algorithms on a convex polytope
Gibbs metropolis convex polyhedron the algorithm
2015/7/7
Gibbs/Metropolis algorithms on a convex polytope。
Sparse PCA: Convex Relaxations, Algorithms and Applications
Sparse PCA Algorithms Applications
2010/11/22
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonzero coefficients in th...
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
Adaptive Algorithms Coverage Control and Space Partitioning
2010/11/9
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distr...
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...
Holographic Algorithms: The Power of Dimensionality Resolved
Holographic Algorithms Dimensionality Resolved
2012/11/29
Valiant’s theory of holographic algorithms is a novel methodology to achieve exponential speed-ups in computation. A fundamental parameter in holographic algorithms is the dimension of the linear basi...
Holographic algorithms are a novel approach to design polynomial time computations using linear superpositions.Most holographic algorithms are designed with basis vectors of dimension 2. Recently Vali...
In holographic algorithms, symmetric signatures have been particularly useful.We give a complete characterization of these symmetric signatures over all bases of size 1. These improve previous results...