开课单位--巴黎大学
1 1/1
1
Convergence of the graph Laplacian application to dimensionality estimation and image segmentation[图拉普拉斯算法的收敛性及其在维数估计和图像分割中的应用]
Jean Yves Audibert(巴黎大学) Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as...
热度:74
Jean Yves Audibert(巴黎大学) Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as...
热度:74
2
WaterFowl: a Compact, Self-indexed and Inference-enabled immutable RDF Store[waterflowl:一个紧凑的、自索引的、支持推理的不可变RDF存储]
Olivier Curé(巴黎大学) In this paper we present WaterFowl, a novel approach for the storage of RDF triples that addresses scalability issues through compression. The archite...
热度:50
Olivier Curé(巴黎大学) In this paper we present WaterFowl, a novel approach for the storage of RDF triples that addresses scalability issues through compression. The archite...
热度:50
3
Boosting Products of Base Classifiers[推进基础Classifiers产品分类]
Balazs Kegl(巴黎大学) In this paper we show how to boost products of simple base learners. Similarly to trees, we call the base learner as a subroutine but in an iterative...
热度:55
Balazs Kegl(巴黎大学) In this paper we show how to boost products of simple base learners. Similarly to trees, we call the base learner as a subroutine but in an iterative...
热度:55
4
Positrons sources for electron-positron colliders. Application to ILC and CLIC[正电子对撞机正电子源。应用于ILC和CLIC]
Robert Chehab(巴黎大学) The increased demanding qualities for positron sources dedicated to e+e- colliders pushed on investigations oriented on new kinds of e+ sources. The d...
热度:44
Robert Chehab(巴黎大学) The increased demanding qualities for positron sources dedicated to e+e- colliders pushed on investigations oriented on new kinds of e+ sources. The d...
热度:44
5
Toward Autonomic Grids: Analyzing the Job Flow with Affinity Streaming[面向自主网格:使用关联流分析作业流]
Xiangliang Zhang(巴黎大学) The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a dataset, ...
热度:28
Xiangliang Zhang(巴黎大学) The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a dataset, ...
热度:28
1 1/1