This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:One-pass_algorithm
rdf:type
yago:Procedure101023820 yago:WikicatAlgorithms yago:YagoPermanentlyLocatedEntity yago:Activity100407535 yago:PsychologicalFeature100023100 yago:Algorithm105847438 yago:Abstraction100002137 yago:Act100030358 yago:Event100029378 yago:Rule105846932
rdfs:label
One-pass algorithm
rdfs:comment
In computing, a one-pass algorithm or single-pass algorithm is a streaming algorithm which reads its input exactly once. It does so by processing items in order, without unbounded buffering; it reads a block into an input buffer, processes it, and moves the result into an output buffer for each step in the process. A one-pass algorithm generally requires O(n) (see 'big O' notation) time and less than O(n) storage (typically O(1)), where n is the size of the input. An example of a one-pass algorithm is the Sondik partially observable Markov decision process.
dcterms:subject
dbc:Streaming_algorithms
dbo:wikiPageID
8756788
dbo:wikiPageRevisionID
1123299588
dbo:wikiPageWikiLink
dbr:Mode_(statistics) dbr:Streaming_algorithm dbr:Mean dbr:Partially_observable_Markov_decision_process dbr:Median dbr:Algorithms_for_calculating_variance dbr:Buffer_(computer_science) dbr:Big_O_Notation dbr:Summation dbr:Standard_deviation dbr:Input_buffer dbr:Variance dbc:Streaming_algorithms
owl:sameAs
wikidata:Q7092332 n10:4sgzp freebase:m.027hnm7 yago-res:One-pass_algorithm
dbp:wikiPageUsesTemplate
dbt:Refimprove dbt:Cs-stub dbt:Short_description
dbo:abstract
In computing, a one-pass algorithm or single-pass algorithm is a streaming algorithm which reads its input exactly once. It does so by processing items in order, without unbounded buffering; it reads a block into an input buffer, processes it, and moves the result into an output buffer for each step in the process. A one-pass algorithm generally requires O(n) (see 'big O' notation) time and less than O(n) storage (typically O(1)), where n is the size of the input. An example of a one-pass algorithm is the Sondik partially observable Markov decision process.
prov:wasDerivedFrom
wikipedia-en:One-pass_algorithm?oldid=1123299588&ns=0
dbo:wikiPageLength
3489
foaf:isPrimaryTopicOf
wikipedia-en:One-pass_algorithm
Subject Item
dbr:Algorithms_for_calculating_variance
dbo:wikiPageWikiLink
dbr:One-pass_algorithm
Subject Item
dbr:Streaming_algorithm
dbo:wikiPageWikiLink
dbr:One-pass_algorithm
Subject Item
dbr:Single-pass_algorithm
dbo:wikiPageWikiLink
dbr:One-pass_algorithm
dbo:wikiPageRedirects
dbr:One-pass_algorithm
Subject Item
wikipedia-en:One-pass_algorithm
foaf:primaryTopic
dbr:One-pass_algorithm