开课单位--伯尔尼大学
1 1/1

1
Speeding up Graph Edit Distance Computation with a Bipartite Heuristic[加快图形编辑距离的计算与一个二分的启发式]
  Kaspar Riesen(伯尔尼大学) In the present paper we aim at speeding up the computation of exact graph edit distance. We propose to combine the standard tree search approach to gr...
热度：136

2
Optoacoustic imaging, a promising technique for non-invasive diagnosis of cancer[光声成像，一个针对癌症的非侵入性诊断很有前途的技术]
  Martin Frenz(伯尔尼大学) Optoacoustics provides high optical contrast without the handicap of poor resolution in imaging of optically turbid tissues. In biomedical optoacoust...
热度：70

3
Sequence learning with hidden units in spiking neural networks[在尖峰神经网络中使用隐藏单元进行序列学习]
  Johanni Brea(伯尔尼大学) We consider a statistical framework in which recurrent networks of spiking neurons learn to generate spatio-temporal spike patterns. Given biologicall...
热度：79

4
Graph Embedding in Vector Spaces by Means of Prototype Selection [用原型选择嵌入向量空间中的图]
  Kaspar Riesen(伯尔尼大学) The field of statistical pattern recognition is characterized by the use of feature vectors for pattern representation, while strings or, more general...
热度：81

5
A Quadratic Programming Approach to the Graph Edit Distance Problem [图形编辑距离问题的二次规划方法]
  Horst Bunke(伯尔尼大学) In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with...
热度：69
1 1/1