<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Y0704__00的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Y0704__00</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Y0704__00]]></copyright><item><title><![CDATA[【排序算法】七种排序算法的C++实现]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127622313</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127622313</guid><author>Y0704__00</author><pubDate>Tue, 01 Nov 2022 00:02:28 +0800</pubDate><description><![CDATA[直接插入排序、希尔排序、冒泡排序、快速排序、简单选择排序、堆排序、递归归并排序
]]></description><category></category></item><item><title><![CDATA[数据结构实验使用说明]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127625262</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127625262</guid><author>Y0704__00</author><pubDate>Tue, 01 Nov 2022 00:02:00 +0800</pubDate><description><![CDATA[通信工程/电子信息的小伙伴看这里！！]]></description><category></category></item><item><title><![CDATA[【算法】Hash表查找算法]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127622144</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127622144</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 19:56:52 +0800</pubDate><description><![CDATA[（除留余数法）查找之前先进行Hash函数的下标转换，若该下标位置处的关键字与key值相等时，返回当前下标；若不相等，移向下一个位置，再次进行判断，如果新下标为空或者最终又回到原始下标时，返回-1，表示未找到。]]></description><category></category></item><item><title><![CDATA[【算法】二叉排序树]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127622052</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127622052</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 19:50:38 +0800</pubDate><description><![CDATA[如果二叉排序树为平衡的，查找效率较高，时间复杂度可达O(logn)。但是当二叉排序树完全不平衡时，深度可达n，与线性表类似，时间复杂度降低为O(n)。]]></description><category></category></item><item><title><![CDATA[【算法】顺序表的查找]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127621859</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127621859</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 19:44:52 +0800</pubDate><description><![CDATA[顺序表的顺序查找和折半查找]]></description><category></category></item><item><title><![CDATA[【数据结构】图算法]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127621445</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127621445</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 19:31:38 +0800</pubDate><description><![CDATA[图的邻接表定义及创建 、无向图上实现深度优先算法 、无向图上实现广度优先遍历算法 、有向无环图上实现拓扑排序算法]]></description><category></category></item><item><title><![CDATA[【数据结构】Huffman树及Huffman编码的算法实现]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127621085</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127621085</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 19:00:17 +0800</pubDate><description><![CDATA[Huffman树为最优二叉树，是一类带权路径长度最短的树。利用Huffman树求得的用于通信的二进制编码称为Huffman编码，创建编码的时间复杂度大致为O(nlogn)。Huffman编码可以之后的字符串的平均长度降低，从而可以达到无损压缩数据的目的。]]></description><category></category></item><item><title><![CDATA[【数据结构】二叉树]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127620760</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127620760</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 18:37:51 +0800</pubDate><description><![CDATA[本次实验是对之前所学的栈、队列以及递归的综合应用，通过栈先进后出，队列先进先出的特性以及递归完成相似重复操作可以解决很多类似问题。]]></description><category></category></item><item><title><![CDATA[【数据结构】队列的基本操作的实现]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127619736</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127619736</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 17:28:25 +0800</pubDate><description><![CDATA[初始化队列后出现该菜单，根据用户选择执行对应的队列操作，并显示结果。可循环出现菜单，直到用户选择“退出”为止，此时销毁队列，结束。]]></description><category></category></item><item><title><![CDATA[【数据结构】栈的基本操作]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127619486</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127619486</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 17:18:23 +0800</pubDate><description><![CDATA[实现栈的基本操作：初始化、置栈空、入栈、出栈、取栈顶元素等，并用栈实现括号匹配的检验。]]></description><category></category></item><item><title><![CDATA[【数据结构】单链表的基本操作]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127618960</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127618960</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 16:57:41 +0800</pubDate><description><![CDATA[利用一个指针，依次获取单链表中的第一个元素。借助一个过渡指针，来存放原链表或者更新后的原链表下一个结点的地址，以便进行迭代。每次循环过程中，要通过过渡指针将L向后移动一个结点，同时利用头插法的原理，将当时L所指的第一个结点插入在New的首位。]]></description><category></category></item><item><title><![CDATA[【数据结构】顺序表的基本操作的实现]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/127618320</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/127618320</guid><author>Y0704__00</author><pubDate>Mon, 31 Oct 2022 16:47:18 +0800</pubDate><description><![CDATA[用静态分配的一维数组和动态分配的一维数组来完成实验题目]]></description><category></category></item><item><title><![CDATA[【CV-Learning】目标检测&实例分割]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/126133793</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/126133793</guid><author>Y0704__00</author><pubDate>Wed, 03 Aug 2022 11:37:59 +0800</pubDate><description><![CDATA[目标检测，也叫目标提取，是一种基于目标几何和统计特征的图像分割。它将目标的分割和识别合二为一，其准确性和实时性是整个系统的一项重要能力。]]></description><category></category></item><item><title><![CDATA[【CV-Learning】语义分割]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/126128018</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/126128018</guid><author>Y0704__00</author><pubDate>Tue, 02 Aug 2022 20:29:59 +0800</pubDate><description><![CDATA[给图像的每个像素分配类别标签，不区别实例，只考虑像素类别。]]></description><category></category></item><item><title><![CDATA[【CV-Learning】卷积神经网络]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/126106562</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/126106562</guid><author>Y0704__00</author><pubDate>Mon, 01 Aug 2022 20:56:45 +0800</pubDate><description><![CDATA[由于全连接网络适合处理小图像，即输入层的维数小。由此我们先可以使用卷积核处理图像，例如将上节预备知识中得到48维特征向量作为输入进行处理，之后进行全连接网络处理。]]></description><category></category></item><item><title><![CDATA[【CV-Learning】卷积神经网络预备知识]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/126096132</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/126096132</guid><author>Y0704__00</author><pubDate>Mon, 01 Aug 2022 13:37:23 +0800</pubDate><description><![CDATA[卷积核就是图像处理时，给定输入图像，输入图像中一个小区域中像素加权平均后成为输出图像中的每个对应像素，其中权值由一个函数定义，这个函数称为卷积核。]]></description><category></category></item><item><title><![CDATA[【CV-Learning】线性分类器（SVM基础）]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/125826496</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/125826496</guid><author>Y0704__00</author><pubDate>Wed, 27 Jul 2022 13:08:58 +0800</pubDate><description><![CDATA[线性分类器是一种线性映射，将输入的图像特征映射为类别分类。通过层级结构（神经网络）或者高维映射（支持向量机）可以形成功能强大的非线性模型。在小型样本情况下，常用支持向量机；在大型样本情况下，常用神经网络。......]]></description><category></category></item><item><title><![CDATA[【CV-Learning】图像分类]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/125824475</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/125824475</guid><author>Y0704__00</author><pubDate>Sat, 16 Jul 2022 21:21:48 +0800</pubDate><description><![CDATA[计算机视觉图像分类；北京邮电大学鲁鹏老师课程笔记]]></description><category></category></item><item><title><![CDATA[【CV-Learning】计算机视觉简介]]></title><link>https://blog.youkuaiyun.com/Y0704__00/article/details/125822998</link><guid>https://blog.youkuaiyun.com/Y0704__00/article/details/125822998</guid><author>Y0704__00</author><pubDate>Sat, 16 Jul 2022 18:46:52 +0800</pubDate><description><![CDATA[计算机视觉入门；北京邮电大学鲁鹏老师课程笔记]]></description><category></category></item></channel></rss>