6274 search results - page 567 / 1255 » From query complexity to computational complexity |
169
click to vote
ESWS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
147
click to vote
LREC
2010
15 years 8 months ago
2010
In the first part of this paper, we present a framework for enriching arbitrary upper or domain-specific ontologies with a concept of time. To do so, we need the notion of a time ...
190
click to vote
SPIESR
2004
15 years 8 months ago
2004
Evaluation in visual information retrieval is usually performed by executing test queries and calculating recall and precision based on predefined media collections and ground tru...
217
click to vote
SODA
1990
ACM
15 years 8 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
217
click to vote
CADE
2010
Springer
15 years 8 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...