2889 search results - page 212 / 578 » Querying Structured Hyperdocuments |
CORIA
2007
13 years 9 months ago
2007
In this paper, we propose a fuzzy model to querying the XML documents, by taking into account not only the document contents, but also their structure. The concept of minimal size ...
IPL
2008
13 years 8 months ago
2008
Bloom filters are a randomized data structure for membership queries dating back to 1970. Bloom filters sometimes give erroneous answers to queries, called false positives. Bloom a...
BMCBI
2011
13 years 3 months ago
2011
Background: Accurate identification of protein domain boundaries is useful for protein structure determination and prediction. However, predicting protein domain boundaries from a...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
COMMA
2008
13 years 9 months ago
2008
Abstract. In previous work, we presented an RDFS ontology, based on the Argument Interchange Format (AIF), for describing arguments and argument schemes. We also implemented a pilo...