Loading

上一页 1 2 3 4 5 6 7 8 9 ··· 16 下一页
摘要: In computational science, particle swarm optimization (PSO)[1] is a computational method that optimizes a problem by iteratively trying to improve a c 阅读全文
posted @ 2020-09-21 20:25 ArkiWang 阅读(615) 评论(0) 推荐(0) 编辑
摘要: Abstract— Having dealt with a very basic local sensing based path finding algorithm -tangent bug - in the first homework, we will focus on again a ver 阅读全文
posted @ 2020-09-21 15:49 ArkiWang 阅读(369) 评论(0) 推荐(0) 编辑
摘要: ref: https://github.com/libspatialindex/libspatialindex/wiki/1.-Getting-Started install homeberw brew install curl brew install make brew install gcc 阅读全文
posted @ 2020-08-19 20:00 ArkiWang 阅读(185) 评论(0) 推荐(0) 编辑
摘要: Constructing GLMs Ordinary Least Squares Ordinary least squares is a special case of the GLM family of models, consider the setting where the target v 阅读全文
posted @ 2020-05-22 16:00 ArkiWang 阅读(69) 评论(0) 推荐(0) 编辑
摘要: Generalized Linear Models In the regression problem, we had y|x;θ ~ N(μ, σ2), and in the classification one, y|x;θ ~ Bernoulli(Φ), for some appropriat 阅读全文
posted @ 2020-05-21 16:42 ArkiWang 阅读(119) 评论(0) 推荐(0) 编辑
摘要: Logistic Regression We can approach the classfication problem ignoring the fact that y is discrete-valued, and use old linear regression algorithm to 阅读全文
posted @ 2020-05-19 15:12 ArkiWang 阅读(91) 评论(0) 推荐(0) 编辑
摘要: the process of supervised learning given dataset with labels then learn the hypothesis/predict function h: x->y through learning algorithm. When the t 阅读全文
posted @ 2020-05-17 16:02 ArkiWang 阅读(156) 评论(0) 推荐(0) 编辑
摘要: Stanford Link Definition Arthur Samuel: Machine Learing is the field of study that gives the computer the ablility to learn with out being explicitly 阅读全文
posted @ 2020-05-17 09:58 ArkiWang 阅读(153) 评论(0) 推荐(0) 编辑
摘要: References: 1.Automatic watermark detection and removal 2.矩阵求导解最小二乘问题 3.IRLS WIKI Encyclopedia 4.Image Gradient WIKI 5.OpenCV Image Gradients 6.矩阵求导 接 阅读全文
posted @ 2020-04-23 00:56 ArkiWang 阅读(325) 评论(0) 推荐(0) 编辑
摘要: 把自己的知乎答案搬来了 从多粒度树的角度着手理解。 在多粒度封锁中,若对一个节点加锁(X、S),意味着这个点的后裔节点也被加以同样的锁。若对一个节点加意向锁,则说明正在对其子节点加(对应的)锁(可理解为一个事务中的先后次序)。任意节点加(X,S)锁时,必须对其所有上级节点加意向锁。多粒度封锁的加锁顺 阅读全文
posted @ 2020-03-27 11:18 ArkiWang 阅读(1820) 评论(0) 推荐(1) 编辑
上一页 1 2 3 4 5 6 7 8 9 ··· 16 下一页