18306 search results - page 3298 / 3662 » Algorithmics in Exponential Time |
135
Voted
SEMWEB
2010
Springer
15 years 1 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
137
Voted
SEMWEB
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
117
Voted
SEMWEB
2010
Springer
15 years 1 months ago
2010
Springer
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is ...
115
click to vote
SOFSEM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider documents as words and trees on some alphabet and study how to compare them with some regular schemas on an alphabet . Given an input document I, we decide ...
146
Voted
WEBI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...