6274 search results - page 171 / 1255 » From query complexity to computational complexity |
143
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
143
click to vote
BIBM
2008
IEEE
15 years 11 months ago
2008
IEEE
Biologists are often interested to query published phylogenetic data for research purposes. PhyQL, a web-based visual phylogenetic query engine, can be quite useful on this regard...
132
click to vote
RECOMB
2007
Springer
16 years 4 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
152
click to vote
WISE
2002
Springer
15 years 9 months ago
2002
Springer
How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
151
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...