Junnan Ding

摘要： 对input做卷积，第一层卷积大小为sliding window大小，后面做正常的pooling与卷积，最后两层全连接，最后生成h*w*(number of parameters to predict)的结果，即为每个sliding window预测的结果 阅读全文

摘要： Harvard Energy Prediction Project 阅读全文

摘要： Gradient boosting regression 阅读全文

摘要： 补缺失数据的方法 阅读全文

摘要： 文本分类 阅读全文

摘要： Spark Transformations 阅读全文

摘要： Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) 阅读全文

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. 阅读全文

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. 阅读全文

摘要： Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the grid. 阅读全文