- 博客(17)
- 资源 (1)
- 收藏
- 关注
原创 LCA
最近公共祖先最近公共祖先问题:LCA问题便是指,给定一棵树T和两个节点u和v,找出u和v的离根节点最远的公共祖先。 Documents既然要查找,就需要遍历整棵树。能不能只通过一次遍历,就找到最近公共祖先呢?答案当然是可以的。下面是利用后序遍历二叉树的递归算法如下:typedef struct lca{ int data; struct lca *left, *right;
2015-04-27 17:19:44 401
原创 0004--Weekly Meeting on 27th April and 8th May, 2015
27th April, 2015(1) coming sonn
2015-04-25 15:50:16 503
原创 0003--Weekly Meeting on 10th April and 20th April, 2015
10th April, 2015(1) Orthogonal Matching Pursuit, Least Angle Regression, Dictionary Coherence.-> appearing in ICML2014 reporter: Yupei Zhang PDF PPT
2015-04-03 21:36:40 329
原创 SCI Index
IEEE Transaction on Patter Analysis and Machine Intelligence (PAMI).[link]
2015-04-03 21:13:16 299
原创 FUND
The Shaanxi Natural Science Plan Project of ChinaGrant NO.: 2014JM8322
2015-03-31 08:55:58 747
原创 0002--Weekly Meeting on 27th March and 3th April, 2015
27th March, 2015(1) RankNet && PageRank->reporter: jinquan Du Web_RankNet Web_PageRank (2) Sparse Subspace Clustering-> appearing in CVPR2009 reporter: Yupei Zhang
2015-03-27 18:40:38 305
原创 By Yupei Zhang
Sparse Learning:i) Sparsity Learning (foundation)ii) Sparsity Learning for Clustering (1) sparse subspace clustering: Algorithm, Theory and Applications[PDF] The collection of data f
2015-03-15 10:40:31 410
原创 International Conference in 2015
International Conference on Machine Learning (ICML2015, Lillr, France). (paper submission has ended)Neural Information Processing System Foundation (NIPS2015).
2015-03-15 10:22:03 1074
原创 International Conference in 2014
International Conference on Machine Learning (ICML2014, Beijing).(papers are available)Neural Information Processing System Foundation (NIPS2014, Quebce).(paper are available)A
2015-03-15 09:38:42 758
原创 0001-Weekly Meeting on 13th and 20th March, 2015
Nearest Neighbors Using Compact Sparse Coding appearing in ICML2014 reporter: Yupei Zhang
2015-03-14 10:19:29 418
原创 ORGANIZATION
Leader: Ming XiangDoctor: Bo YangYupei ZhangMaster:Cheng Feng Jinquan DuYouling MaYun Yang
2015-03-14 10:06:22 215
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人