lypbendlf - 博客园

2018年8月21日

摘要： 1.问题描述与 OCR pipeline 图1.图像文字识别流水线首先是输入图片-》进行文字检测-》字符分割-》字符识别。这些阶段分别需要1-5人这样子。 2.滑动窗口主要讲滑动窗口分类器。图2.滑动窗口检测对于行人检测来说，矩阵框有长宽相同的比例，虽然具体的数值会变化，但比例不变；但是对阅读全文

posted @ 2018-08-21 20:15 lypbendlf 阅读(186) 评论(0) 推荐(0) 编辑

PAT 1097 Deduplication on a Linked List[比较]

摘要： Given a singly linked list L with integer keys, you are supposed to remove the nodes with duplicated absolute values of the keys. That is, for each va 阅读全文

posted @ 2018-08-21 15:43 lypbendlf 阅读(399) 评论(0) 推荐(0) 编辑

2018年8月20日

PAT 1103 Integer Factorization[难]

摘要： The K−P factorization of a positive integer N is to write N as the sum of the P-th power of K positive integers. You are supposed to write a program t 阅读全文

posted @ 2018-08-20 23:46 lypbendlf 阅读(228) 评论(0) 推荐(0) 编辑

PAT 1101 Quick Sort[一般上]

摘要： There is a classical process named partition in the famous quick sort algorithm. In this process we typically choose one element as the pivot. Then th 阅读全文

posted @ 2018-08-20 19:19 lypbendlf 阅读(166) 评论(0) 推荐(0) 编辑

Andrew Ng-ML-第十八章-大规模机器学习

摘要： 1.学习大数据集图1.学习大数据集当数据集量为m=1亿时，进行梯度下降将会花费较大时间。可以使用小量数据集进行训练，然后得出学习曲线。左图是高方差，右图是高偏差。总之是要通过高效的学习算法来进行大数据学习。 2.随机梯度下降图2.批梯度下降假设是美国人口普查的数据，m=3亿，如果需要每阅读全文

posted @ 2018-08-20 12:08 lypbendlf 阅读(155) 评论(0) 推荐(0) 编辑

PAT 1070 Mooncake[一般]

摘要： Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional 阅读全文

posted @ 2018-08-20 11:33 lypbendlf 阅读(119) 评论(0) 推荐(0) 编辑

PAT 1054 The Dominant Color[简单][运行超时的问题]

摘要： Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color 阅读全文

posted @ 2018-08-20 10:30 lypbendlf 阅读(151) 评论(0) 推荐(0) 编辑

2018年8月19日

PAT 1042 Shuffling Machine[难]

摘要： Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid "ins 阅读全文

posted @ 2018-08-19 20:31 lypbendlf 阅读(196) 评论(0) 推荐(0) 编辑

PAT 1066 Root of AVL Tree[AVL树][难]

摘要： An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any 阅读全文

posted @ 2018-08-19 18:39 lypbendlf 阅读(181) 评论(0) 推荐(0) 编辑

PAT 1064 Complete Binary Search Tree[二叉树][难]

摘要： A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes 阅读全文

posted @ 2018-08-19 12:06 lypbendlf 阅读(125) 评论(0) 推荐(0) 编辑

公告