357 search results - page 19 / 72 » An Algebraic Approach to the Complexity of Generalized Conju... |
ICDT
2001
ACM
14 years 12 days ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
SDB
1995
13 years 11 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...
CIVR
2010
Springer
13 years 11 months ago
2010
Springer
One of the main challenges in interactive concept-based video search is the insufficient relevant sample problem, especially for queries with complex semantics. To address this pr...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...