While the Semantic Web requires a large amount of structured knowledge (triples) to allow machine reasoning, the acquisition of this knowledge still represents an open issue. Indee...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
This work focusses on bridging between folksonomies, which provide social but mainly flat and unstructured metadata on web resources, and semantic web ontologies, which instead des...