开课单位--代尔夫特工业大学
1 1/1

1
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth[利用低树宽计算所有对最短路径]
  Léon Planken(代尔夫特工业大学) Considering directed graphs on n vertices and m edges with real (possibly negative) weights, we present two new, efficient algorithms for computing al...
热度:67

2
Spectral Dimensionality Reduction via Maximum Entropy, incl. discussion by Laurens van der Maaten[通过最大熵谱降维,包括讨论劳伦斯范德华maaten]
  Neil D. Lawrence, Laurens van der Maaten(代尔夫特工业大学) We introduce a new perspective on spectral dimensionality reduction which views these methods as Gaussian random fields (GRFs). Our unifying perspecti...
热度:55

3
Bag Dissimilarities for Multiple Instance Learning[多实例学习的袋差异]
  David M. J. Tax(代尔夫特工业大学) When objects cannot be represented well by single feature vectors, a collection of feature vectors can be used. This is what is done in Multiple Insta...
热度:72

4
Barriers and Drivers of Digital Transformation in Public Organizations[公共组织数字化转型的障碍和驱动力]
  Luca Tangi(代尔夫特工业大学) Barriers and Drivers of Digital Transformation in Public Organizations
热度:33
1 1/1