自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

Ugly Gardon

世界因我而不同 【移步我的GITHUB博客 Baileyswu.github.io】

  • 博客(4)
  • 资源 (2)
  • 收藏
  • 关注

原创 Codeforces 553D Nudist Beach 优先队列 贪心

原题见CF 553D无向图G,n个点,m条边,k个坏点。 在G中选取子图S(可以不连通),S不能包含坏点。对于每个S中的点x,描述强度值I=x的属于S的邻居数/x的所有邻居数。I=x的属于S的邻居数/x的所有邻居数。x的邻居是指和他有直接相连的一条边的点。 现在求一个子图S,使得S中的强度值最小的尽量大。思路先把所有非坏点的选入图S。从中挑出强度值最小的点x移出S。修改和x相邻的点的强度值。

2016-04-28 17:54:09 1273

原创 数据结构报告

报告用的,和之前的内容可能有点重请见谅;)线段树降维恍然大悟给出一些矩形的位置和大小,求总共覆盖面积。 示意图解法: 一个方向作为扫描线。另一个方向坐标离散化。 扫描线往上划,依次更新区间。注意:定义好每个变量的含义。 cover是一个区间被完全覆盖时,计数覆盖了几重。子区间不用继承父区间的重数,否则在更新时会出错!(这点坑了一天) has是一个区间完全没被覆盖置为0,否则只要沾边

2016-04-22 22:46:33 1334

原创 ZOJ 1460 The Partition of a Cake 线段相交

原题见ZOJ 1460(zoj网站经常挂,还是链到NJOJ吧) 一个正方形蛋糕边长为1000,并给了四个点位置固定。 现在上面切n条线,请问可以被切成几块。思路先考虑直线的切割。若在原图中已经有若干条直线,再增加一条直线,和原图有k个交点,则平面块数将增加k+1. 当交点发生重叠时,则应该增加的块数(边长为0的一块东西)不计入。 现考虑在正方形中的切割,则只需在原本增加的块数中减去2块,即向

2016-04-03 22:29:35 663

原创 POJ 1703 Find them, Catch them 并查集

原题见POJ 1703N个人,M种输入,要么是声明两者不是同伙,要么是询问两者是否是同伙。思路年幼不懂事,看着紫书上的秩做的,今天重新思考一番,其实原理和积木移动的想法如出一辙。 把人当作积木,可以相互堆叠,a[i]为积木i底下的积木的个数(不严格,也可以是和这个数同奇偶的数字,在每次get累加路径上所有的a才能得到),p[i]为这堆积木最低端的积木编号。初始a[i]=0,p[i]=i. 声明操

2016-04-03 01:38:17 633

[免费下载]自动机理论、语言和计算导论

华东师范大学 计算理论基础 教材 《自动机理论、语言和计算导论》原书第三版 华东师范大学 计算理论基础 教材 《自动机理论、语言和计算导论》原书第三版

2017-09-25

Pattern Recognition And Machine Learning

The dramatic growth in practical applications for machine learning over the last ten years has been accompanied by many important developments in the underlying algorithms and techniques. For example, Bayesian methods have grown from a specialist niche to become mainstream, while graphical models have emerged as a general framework for describing and applying probabilistic techniques. The practical applicability of Bayesian methods has been greatly enhanced by the development of a range of approximate inference algorithms such as variational Bayes and expectation propagation, while new models based on kernels have had a significant impact on both algorithms and applications., This completely new textbook reflects these recent developments while providing a comprehensive introduction to the fields of pattern recognition and machine learning. It is aimed at advanced undergraduates or first-year PhD students, as well as researchers and practitioners. No previous knowledge of pattern recognition or machine learning concepts is assumed. Familiarity with multivariate calculus and basic linear algebra is required, and some experience in the use of probabilities would be helpful though not essential as the book includes a self-contained introduction to basic probability theory., The book is suitable for courses on machine learning, statistics, computer science, signal processing, computer vision, data mining, and bioinformatics. Extensive support is provided for course instructors, including more than 400 exercises, graded according to difficulty. Example solutions for a subset of the exercises are available from the book web site, while solutions for the remainder can be obtained by instructors from the publisher. The book is supported by a great deal of additional material, and the reader is encouraged to visit the book web site for the latest information.

2016-10-03

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除