<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[达哥是超人的博客]]></title><description><![CDATA[逐渐成长中的技术新人]]></description><link>https://blog.youkuaiyun.com/u014274339</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u014274339]]></copyright><item><title><![CDATA[秋招-计算机视觉、机器学习岗需要复习的内容]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/74550871</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/74550871</guid><author>u014274339</author><pubDate>Thu, 06 Jul 2017 15:12:05 +0800</pubDate><description><![CDATA[计算机视觉、机器学习岗需要复习的内容编程基础
C++基础知识学习：《C++ primer》
算法编程：Leetcode，牛客网，《算法导论》
编程思想： 《算法导论》，《程序员面试宝典》，《剑指offer》
其他语言熟悉： Python，Scala，Matlab等
机器学习基础知识 ——《统计学习方法》、《机器学习》
特征工程 ：《机器学习》，《模式识别》，google，tencent课件
机器学习]]></description><category></category></item><item><title><![CDATA[图像质量评价研究综述]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/70053276</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/70053276</guid><author>u014274339</author><pubDate>Tue, 11 Apr 2017 14:44:21 +0800</pubDate><description><![CDATA[1.  主观评价方法
1)        准备样本集
2)        由观测者对样本集图像进行评价
3)        对主观评价结果进行加工
2.   客观评价方法
1)        全参考
a)        基于误差统计量的算法
                        i.             来源于通信理论：信号保真度（峰值信噪比、目标信息密度）
    ]]></description><category></category></item><item><title><![CDATA[Note: Learningwithout Human Scores for Blind Image Quality Assessment]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/70053252</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/70053252</guid><author>u014274339</author><pubDate>Tue, 11 Apr 2017 14:41:41 +0800</pubDate><description><![CDATA[Xue W, Zhang L, Mou X. Learning without human scores for blindimage quality assessment[C]//Proceedings of the IEEE Conference on ComputerVision and Pattern Recognition. 2013: 995-1002.
1.        Abst]]></description><category></category></item><item><title><![CDATA[2017年网易游戏数据挖掘/机器学习实习生笔试回忆]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/69665260</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/69665260</guid><author>u014274339</author><pubDate>Sat, 08 Apr 2017 10:40:20 +0800</pubDate><description><![CDATA[2017年网易游戏数据挖掘/机器学习实习生笔试回忆笔试题回忆 7道简答+1道编程
大意是已知： 1. 机器良好情况下产品合格的概率；2. 机器非良好情况下产品合格的概率；3. 机器调整良好的概率。  求： 产品合格时机器良好的概率。 
  思路：一道利用贝叶斯公式和全概率公式求解的概率题，只要套用公式，不是很难有一枚密度不均匀的硬币，设计一种方法，使得可以等概率随机产生1到3之间的整数。
  思路：]]></description><category></category></item><item><title><![CDATA[leetcode:46. Permutations 排列]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/69367674</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/69367674</guid><author>u014274339</author><pubDate>Thu, 06 Apr 2017 00:15:22 +0800</pubDate><description><![CDATA[46. Permutations问题描述Given a collection of distinct numbers, return all possible permutations.For example, 
[1,2,3] have the following permutations: 
[ 
  [1,2,3], 
  [1,3,2], 
  [2,1,3], 
  [2,3,1],]]></description><category></category></item><item><title><![CDATA[leetcode：31. Next Permutation 下一个排列]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/69367479</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/69367479</guid><author>u014274339</author><pubDate>Wed, 05 Apr 2017 23:30:35 +0800</pubDate><description><![CDATA[31. Next Permutation 下一个排列]]></description><category></category></item><item><title><![CDATA[2017年华为实习面试心得]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/68482981</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/68482981</guid><author>u014274339</author><pubDate>Thu, 30 Mar 2017 09:14:41 +0800</pubDate><description><![CDATA[华为实习  算法工程师-媒体算法流程
宣讲会： 重要信息不要错过
官网投递简历： 每个大公司都有自己的招聘官网，每投一个公司就要写一次简历
综合素质测评：  其实是心理素质测评吧，不涉及专业知识和智力测试，正常填写就行
两轮面试 
专业面试：主要问项目问的多，还有结合项目，问相关的机器学习的知识，会深度学习有优势
综合面试： 简单聊了一下项目，然后聊一些其他的
岗位介绍  算法工程师-媒体算法
算法]]></description><category></category></item><item><title><![CDATA[图像处理的一些相关知识(Related knowledge for IQA)]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/64907421</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/64907421</guid><author>u014274339</author><pubDate>Wed, 22 Mar 2017 12:54:44 +0800</pubDate><description><![CDATA[图像质量评价相关知识(Related knowledge for IQA)： 讲述一些在数字图像处理中可能会用到的一些概念。]]></description><category></category></item><item><title><![CDATA[排序算法-堆排序]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/64904281</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/64904281</guid><author>u014274339</author><pubDate>Wed, 22 Mar 2017 08:06:19 +0800</pubDate><description><![CDATA[堆排序堆排序算法思路详细思路请参考《算法导论》堆排序一章，算法描述如下：输入： 无序数组nums
输出： 有序数组nums
1. 使用heapSort()将无序数组nums建成最大堆
2. 从数组最后一个元素倒序遍历：i 
    1. 交换第一个元素和第i个元素的值
    2. 去除堆的最后一个元素，将堆的长度-1
    3. 调用maxHeapify()维护堆，使其重新为最大堆
    4.]]></description><category></category></item><item><title><![CDATA[Leetcode：78. Subsets 求集合的子集]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/64904277</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/64904277</guid><author>u014274339</author><pubDate>Wed, 22 Mar 2017 08:05:23 +0800</pubDate><description><![CDATA[Leetcode：78. Subsets 求集合的子集]]></description><category></category></item><item><title><![CDATA[39. Combination Sum 求目标和的元素集合]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/64115318</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/64115318</guid><author>u014274339</author><pubDate>Mon, 20 Mar 2017 08:04:12 +0800</pubDate><description><![CDATA[39. Combination Sum 求目标和的元素集合]]></description><category></category></item><item><title><![CDATA[538. Convert BST to Greater Tree 二叉搜索树转化为更大的树]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/63686053</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/63686053</guid><author>u014274339</author><pubDate>Sun, 19 Mar 2017 17:06:33 +0800</pubDate><description><![CDATA[538. Convert BST to Greater Tree 二叉搜索树转化为更大的树]]></description><category></category></item><item><title><![CDATA[543. Diameter of Binary Tree  二叉树的直径]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/63685789</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/63685789</guid><author>u014274339</author><pubDate>Sun, 19 Mar 2017 16:45:34 +0800</pubDate><description><![CDATA[543. Diameter of Binary Tree 二叉树的直径]]></description><category></category></item><item><title><![CDATA[几道Leetcode题思路与代码]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/63685216</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/63685216</guid><author>u014274339</author><pubDate>Sun, 19 Mar 2017 15:47:26 +0800</pubDate><description><![CDATA[几道leetcode题的思路与代码]]></description><category></category></item><item><title><![CDATA[排序算法总结]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/63683746</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/63683746</guid><author>u014274339</author><pubDate>Sun, 19 Mar 2017 12:53:58 +0800</pubDate><description><![CDATA[排序算法总结：插入排序，冒泡排序、选择排序，快速排序、归并排序、计数排序]]></description><category></category></item><item><title><![CDATA[leetCode:283.Move Zeros]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/52198665</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/52198665</guid><author>u014274339</author><pubDate>Sat, 13 Aug 2016 12:15:54 +0800</pubDate><description><![CDATA[1. 问题英文描述：


Given an array nums, write a function to move all 0's
 to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1,
 0, 3, 12],]]></description><category></category></item><item><title><![CDATA[Note《Anchored Neighborhood Regression for Fast Example-Based Super-Resolution》]]></title><link>https://blog.youkuaiyun.com/u014274339/article/details/50950354</link><guid>https://blog.youkuaiyun.com/u014274339/article/details/50950354</guid><author>u014274339</author><pubDate>Mon, 21 Mar 2016 21:22:17 +0800</pubDate><description><![CDATA[Note：
Anchored NeighborhoodRegression for Fast Example-Based Super-Resolution
 
1.        Abstract
a)        Propose fast super-resolutionmethods while making no compromise on quality]]></description><category></category></item></channel></rss>