6274 search results - page 167 / 1255 » From query complexity to computational complexity |
135
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
141
click to vote
EKAW
2006
Springer
15 years 8 months ago
2006
Springer
Semantic search promises to produce precise answers to user queries by taking advantage of the availability of explicit semantics of information in the context of the semantic web....
138
click to vote
AMW
2010
15 years 5 months ago
2010
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...
191
click to vote
DLOG
2011
14 years 8 months ago
2011
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
124
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...