An evaluation of models for runtime approximation in link discovery-Reference-Cited by-同舟云学术

An evaluation of models for runtime approximation in link discovery

Published:2017-08-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the International Conference on Web Intelligence
language:
Short-container-title:

Author:

Georgala Kleanthi¹,Hoffmann Michael¹,Ngomo Axel-Cyrille Ngonga²

Affiliation:

1. University of Leipzig, Leipzig, Germany

2. Paderborn University, Pacerborn, Germany

Funder

HOBBIT, QAMEL, SAKE

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3106426.3106428

Reference23 articles.

1. Sören Auer Jens Lehmann Axel-Cyrille Ngonga Ngomo and Amrapali Zaveri. 2013. Introduction to linked data and its lifecycle on the web. In Reasoning Web. Semantic Technologies for Intelligent Data Access. Springer 1--90. 10.1007/978-3-642-39784-4_1 Sören Auer Jens Lehmann Axel-Cyrille Ngonga Ngomo and Amrapali Zaveri. 2013. Introduction to linked data and its lifecycle on the web. In Reasoning Web. Semantic Technologies for Intelligent Data Access. Springer 1--90. 10.1007/978-3-642-39784-4_1

2. Eddies

3. An overview of query optimization in relational systems

4. Optimization of dynamic query evaluation plans

5. Pierre Courrieu. 2008. Fast computation of Moore-Penrose inverse matrices. arXiv preprint arXiv:0804.4809 (2008). Pierre Courrieu. 2008. Fast computation of Moore-Penrose inverse matrices. arXiv preprint arXiv:0804.4809 (2008).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Transparency in the Design-Accompanying Production on Shipyards;Procedia CIRP;2019

2. A Probabilistic Algorithm to Predict Missing Facts from Knowledge Graphs;Lecture Notes in Computer Science;2019

3. Dynamic Planning for Link Discovery;The Semantic Web;2018