- 博客(171)
- 收藏
- 关注
原创 wordnet学习记录
人们经常区分词语知识和世界知识。前者体现在词典中,后者体现在百科全书中。事实上二者的界限是模糊的。比如hit(“打”)某人是一种带有敌意的行为,这是百科知识;而hit跟strike(“击”)多多少少同义,并且hit可以带一个直接宾语论元,这是词语知识。但hit的直接宾语应该是固体(而不是像gas这样的气体),这是词语知识还是百科知识就界限模糊了。不过毫无疑问,要理解语言,这两部分知识是缺一不可的。
2014-01-12 03:36:31 675
原创 learning to rank资料汇总
如何理解 Learning to rank http://hi.baidu.com/nuumkxjinrbacgd/item/9b8ea4f44126e9723d198b1e Learning to Rank小结 http://blog.crackcell.com/posts/2011/12/17/a_short_intro_2_ltr.html 漫
2013-12-07 22:46:25 579
转载 【转载】IT屌丝如何成为数据科学家?
http://www.ctocio.com/ccnews/13588.html 数据科学家被《财富》杂志誉为21世纪最性感的职业,但遗憾的是大多数企业里都没有真正的数据科学家人才。根据麦肯锡报告,仅仅在美国市场,2018年大数据人才和高级分析专家的人才缺口将高达19万。此外美国企业还需要150万位能够提出正确问题、运用大数据分析结果的大数据相关管理人才。 那么,对于不同职业经历和专
2013-11-26 18:29:34 656
转载 【转载】人最重要的几个素质/能力
http://www.newsmth.net/nForum/#!article/WorkLife/524639?p=1 1.开放的思维(固执的人永远都认为自己是对的,也就没有了进步的空间) 2.能分清楚轻重缓急(把精力投入到重要的事情上,做正确的事情远远大于把事情做正 确) 3.规划能力(如何做正确的事情并一步步成功) 4.强大的执行能力(把正确的事情坚持做下去) 5.表达能
2013-11-19 22:17:53 709
原创 MySQL使用汇总
MySQL添加索引命令 1.PRIMARY KEY(主键索引) mysql>ALTER TABLE `table_name` ADD PRIMARY KEY ( `column` ) 2.UNIQUE(唯一索引) mysql>ALTER TABLE `table_name` ADD UNIQUE ( `column` ) 3.INDEX(
2013-11-16 01:53:49 516
原创 【leetcode】Valid Number
class Solution { public: bool isNumber(const char *s) { // Note: The Solution object is instantiated only once and is reused by each test case. //有限自动机,和处理图书章节前的“第1.1章”的方法类似
2013-10-29 23:20:42 570
转载 【转载】计算广告学-搜索广告与广告网络Demand技术-流式计算平台
搜索广告与广告网络Demand技术 原作者:刘鹏 @北冥乘海生 编辑:Koala++/屈伟 视频课程:师徒网 流式计算平台-Storm 我们以Storm为例来看流式计算的功能是什么。 下面内容引用自大圆的博客。在Storm中,一个实时应用的计算任务被打包作为Topology发布,这同Hadoop的MapReduce任务相似。但是有一点不同的
2013-10-24 23:49:53 565
转载 【转载】搜索广告与广告网络Demand技术
搜索广告与广告网络Demand技术 原作者:刘鹏 @北冥乘海生 编辑:Koala++/屈伟 视频课程:师徒网 流式计算平台-Storm 我们以Storm为例来看流式计算的功能是什么。 下面内容引用自大圆的博客。在Storm中,一个实时应用的计算任务被打包作为Topology发布,这同Hadoop的MapReduce任务相似。但是有一点不同的
2013-10-22 02:31:43 559
原创 【leetcode】Search a 2D Matrix
class Solution { public: bool searchMatrix(vector > &matrix, int target) { // Note: The Solution object is instantiated only once and is reused by each test case. int m=matrix.size
2013-10-13 01:39:07 369
原创 【leetcode】Pow(x, n)
class Solution { public: double powPositive(double x,int n) { if(n==0)return 1; if(n==1)return x; double tmp; if(n%2==0) { tmp=pow
2013-10-11 22:16:07 469
转载 【转载】知识库构建前沿:自动和半自动知识提取
编者按:在过去几十年,人们曾尝试采用直接编辑知识、利用大众智慧、自动或半自动知识抽取三类方法来构建知识库。随着时代发展,直接编辑知识由于受时间和经济成本的约束,这种方式很难实现大规模知识库的构建。而利用大众智慧是指利用互联网众包机制,过于依赖激励机制将降低知识库运行稳定性。微软亚洲研究院主管研究员史树明在本文中重点讨论第三类方法——自动或半自动知识抽取,其基本思想是设计自动或半自动的算法,从现有的
2013-10-11 21:34:30 1838
转载 【转载】从图谱搜索看搜索技术的发展趋势
编者按:图谱搜索(Graph Search)是基于社交图谱构建起来的搜索服务,与基于关键词匹配的传统网络搜索引擎相比,图谱搜索能够支持更自然、复杂的查询输入,并针对查询直接给出答案。在微软亚洲研究院副研究员段楠眼中,这样的高效个性化搜索会越来越多。文章中,他从基础架构、自然语言接口、相关研究、发展趋势等几个方面,对计算搜索的现在和未来进行了总结和展望。 作者微软亚洲研究院 段楠
2013-10-11 21:33:05 864
原创 【leetcode】Permutations II
class Solution { public: vector > permuteUnique(vector &num) { // Note: The Solution object is instantiated only once and is reused by each test case. vector >ans; sort(num
2013-10-11 01:55:16 438
原创 【leetcode】Single Number II
class Solution { public: int singleNumber(int A[], int n) { // Note: The Solution object is instantiated only once and is reused by each test case. int x[32];//记录A[]中的每一位 m
2013-10-11 01:23:55 720
原创 【leetcode】Single Number
class Solution { public: int singleNumber(int A[], int n) { // Note: The Solution object is instantiated only once and is reused by each test case. int ans=0; for(int i=0;i
2013-10-10 23:33:24 403
原创 【leetcode】Permutations
class Solution { public: vector > permute(vector &num) { // Note: The Solution object is instantiated only once and is reused by each test case. vector >ans; sort(num.begin
2013-10-10 15:57:03 369
原创 【leetcode】Next Permutation
class Solution { public: void nextPermutation(vector &num) { // Note: The Solution object is instantiated only once and is reused by each test case. for(int i=num.size()-2;i>=0;i--
2013-10-10 15:39:46 378
原创 【leetcode】Subsets
class Solution { public: vector > subsets(vector &S) { // Note: The Solution object is instantiated only once and is reused by each test case. int N=S.size(); sort
2013-10-09 00:46:37 490
原创 【leetcode】Combinations
class Solution { public: vector >ans; vectortmp; void dfs(int dep,int maxDep,int start,int end) { if(dep==maxDep) { ans.push_back(tmp); re
2013-10-09 00:28:18 425
原创 【leetcode】Sqrt(x)
class Solution { public: int sqrt(int x) { // Note: The Solution object is instantiated only once and is reused by each test case. int sta=0,end=x; while(sta<=end)//等号不能丢
2013-10-08 23:49:31 402
原创 【leetcode】Palindrome Number
class Solution { public: bool isPalindrome(int x) { // Note: The Solution object is instantiated only once and is reused by each test case. if(x<0) return false;
2013-10-08 23:29:47 377
原创 【leetcode】Plus One
class Solution { public: vector plusOne(vector &digits) { // Note: The Solution object is instantiated only once and is reused by each test case. reverse(digits.begin(),digits.end(
2013-10-08 21:48:24 378
原创 【leetcode】Reverse Integer
class Solution { public: int reverse(int x) { // Note: The Solution object is instantiated only once and is reused by each test case. if(x==0) return 0;//x==0 int
2013-10-08 20:53:26 402
原创 【leetcode】Add Binary
class Solution { public: string addBinary(string a, string b) { // Note: The Solution object is instantiated only once and is reused by each test case. reverse(a.begin(),a.end());
2013-10-08 20:24:38 404
原创 【leetcode】Search in Rotated Sorted Array II
class Solution { public: bool search(int A[], int n, int target) { // Note: The Solution object is instantiated only once and is reused by each test case. int sta=0,end=n-1;
2013-10-08 13:32:14 388
原创 【leetcode】Search in Rotated Sorted Array
class Solution { public: int search(int A[], int n, int target) { // Note: The Solution object is instantiated only once and is reused by each test case. int sta=0,end=n-1;
2013-10-08 02:52:01 341
原创 【leetcode】3Sum Closest
class Solution { public: int threeSumClosest(vector &num, int target) { // Note: The Solution object is instantiated only once and is reused by each test case. int ans; boo
2013-10-08 02:13:10 482
原创 【leetcode】3Sum
class Solution { public: vector > threeSum(vector &num) { // Note: The Solution object is instantiated only once and is reused by each test case. vector >ans; if(n
2013-10-08 01:39:53 408
原创 【leetcode】Roman to Integer
class Solution { public: int romanToInt(string s) { // Note: The Solution object is instantiated only once and is reused by each test case. int n=s.size(); if(n==0)
2013-10-08 00:48:31 387
原创 【leetcode】Valid Palindrome
class Solution { public: bool check1(char ch)//当ch在'a'-'z'之间时,返回true { if(ch>='a'&&ch<='z') return true; return false; } bool check2(char ch)//当ch
2013-10-07 22:36:42 442
原创 【leetcode】Set Matrix Zeroes
class Solution { public: void setZeroes(vector > &matrix) { // Note: The Solution object is instantiated only once and is reused by each test case. int rowLen=matrix.size()
2013-10-07 21:57:48 402
原创 【leetcode】Implement strStr()
class Solution { public: void getPre(char *needle,vector &pre,int neeLen)//对目标串,产生一个部分匹配的数组 { int k; pre[0]=-1; for(int i=1;i<neeLen;i++) { k=pre[i
2013-10-07 19:40:49 511
原创 【leetcode】Binary Tree Level Order Traversal II
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2013-10-07 15:11:37 377
原创 【leetcode】Binary Tree Level Order Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2013-10-07 13:47:53 448
原创 【leetcode】Binary Tree Inorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2013-10-06 20:59:22 431
原创 【leetcode】Merge Sorted Array
class Solution { public: void merge(int A[], int m, int B[], int n) { // Note: The Solution object is instantiated only once and is reused by each test case. vector tmp(m+n,0);//O(
2013-10-06 20:39:00 356
原创 【leetcode】Remove Duplicates from Sorted Array II
class Solution { public: int removeDuplicates(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if(n==0||n==1||n==2)//n<=2的情况
2013-10-06 19:59:08 455
原创 【leetcode】Remove Duplicates from Sorted Array
class Solution { public: int removeDuplicates(int A[], int n) { // Note: The Solution object is instantiated only once and is reused by each test case. int groupNum=0;
2013-10-06 01:54:54 516
原创 【leetcode】Remove Element
class Solution { public: int removeElement(int A[], int n, int elem) { // Note: The Solution object is instantiated only once and is reused by each test case. int count=0;
2013-10-06 01:39:12 443
原创 【leetcode】Construct Binary Tree from Inorder and Postorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Soluti
2013-10-06 00:20:58 755
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人