Matches in Nanopublications for { <http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#paragraph> ?p ?o ?g. }
Showing items 1 to 2 of
2
with 100 items per page.
- paragraph type Paragraph assertion.
- paragraph hasContent "Proof. The algorithm of the Find stage iterates over all the triples associated with each distinct triple subject in T , therefore the complexity of this stage is O(|T |). In the Verify stage, the algorithm firstly iterates over the answers obtained from the previous stage, which corresponds to T . Next, the algorithm iterates over the quality issues detected in the Find stage; in the worst case, each quality issue is found in at least one triple, then, the set Q 0 is equal to Q. For each quality is- sue, the algorithm processes the triples annotated with that quality issue, which again in the worst case is T (all the triples present all the quality issues). There- fore, the complexity of the Find stage is calculated as O(|T | + |T ||Q|), then O(|T ||Q|). " assertion.