Feb 202017

上周五终于把paper submit到KDD了,忙了这么长时间总算给自己了一个交代。还是hope for the best XD

周末浪了两天,今天开始该收心了。需要找到一个新的research topic;现在有一些想法,但是都不是特别的成熟。还是需要更加努力啊=_=


感觉生活状态总是这样波澜不惊,每天都差不太多,没什么新鲜的事情。上次发朋友圈还是去年,生活中好像没什么可以跟别人share的=_= 感觉自己好无趣啊。


 Posted by at 9:24 PM
Feb 202017

Weisfeiler-Lehman Graph Kernels: http://www.jmlr.org/papers/volume12/shervashidze11a/shervashidze11a.pdf

Graph Kernels:

**Deep Graph Kernels:


 Posted by at 6:17 PM
Feb 142017

搞了半个多月paper,这周五终于要结束了。Hope for the best。

没有完全想好之后的long-term goal是什么,把现在的paper submit之后要仔细读读之前没好好看的papers。今天又发现之前想到的一个idea被别人做了,看来下手还是得快啊。



 Posted by at 7:00 PM
Jan 012017

(1) 在(最好是top conference)发表一篇一作paper -- PhD相关
(2) 写两篇新paper -- PhD相关,争取做些有趣的research
(3) 做15场codeforces -- 兴趣 / 对面试有好处
(4) Leetcode完成度 > 95% -- 为找工作做准备
(4) 减10斤 -- 对健康有好处,而且现在这个样子自己都看不过去
(5) 读50本书 -- 因为自己太无知了
(6) 写20篇blog -- 记录一些值得记录的东西
(7) 在野狐/弈城9D上下50盘棋 -- 继续提高围棋水平
(8) 完了想不出来了.. 先这样!

 Posted by at 5:44 AM
Oct 232016

I am back!

Link to the contest: http://codeforces.com/contest/732

Problem C:
Brute-force is enough for this one. Enumerate the 4 configurations for the first day, and the 4 four configurations for the last day. For example, the 4 configurations for the first day: arrive before breakfast, before dinner, before supper or after supper.

After that, assume Vasiliy have a breakfasts, b dinners and c suppers on the other days -- then he needs to stay for max(a, b, c) additional days to finish that many meals. Choose the best configuration from the 4 * 4 different configurations.

Problem D:
Binary search + Greedy. One observation: if we could pass the exam for course i on k different dates, choose the last date is always the best, so that we could prepare on some other course earlier.

Thus, we could do binary search on the answer, and judge if it is possible to pass all exams.

Problem E:
The most important thing: each socket can only connect to at most ONE computer.

Sort the power of sockets in ascending order. Then for each socket i with power s_i, check if there is a computer with power s_i, s_i / 2, s_i / 2 / 2, \cdots, 1. You must check in this order to ensure minimum number of adapters are used.

Get TLE using Python, faint. I will try C++ later... -- Got accepted with C++.

 Posted by at 10:38 AM