6274 search results - page 213 / 1255 » From query complexity to computational complexity |
129
click to vote
FASE
2000
Springer
15 years 8 months ago
2000
Springer
g higher levels of abstraction with automated downward transformations has always been the way to go, as long as the engineers who do the actual work are th the abstractions. A dev...
133
click to vote
AAAI
1994
15 years 6 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
126
click to vote
PODS
2002
ACM
16 years 4 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
154
click to vote
DASFAA
2007
IEEE
15 years 11 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
162
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...