Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Count-distinct_problem> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Count-distinct_problem abstract "In computer science, the count-distinct problem(also known in applied mathematics as the cardinality estimation problem) is the problem of finding the number of distinct elements in a data stream with repeated elements.This is a well-known problem with numerous applications. The elements might represent IP addresses of packets passing through a router, unique visitors to a web site, elements in a large database, motifs in a DNA sequence, or elements of RFID/sensor networks.".
- Count-distinct_problem wikiPageID "44119508".
- Count-distinct_problem wikiPageLength "9888".
- Count-distinct_problem wikiPageOutDegree "23".
- Count-distinct_problem wikiPageRevisionID "674474256".
- Count-distinct_problem wikiPageWikiLink Category:Statistical_algorithms.
- Count-distinct_problem wikiPageWikiLink Count–min_sketch.
- Count-distinct_problem wikiPageWikiLink DNA.
- Count-distinct_problem wikiPageWikiLink Daniel_Kane_(mathematician).
- Count-distinct_problem wikiPageWikiLink Hash_function.
- Count-distinct_problem wikiPageWikiLink HyperLogLog.
- Count-distinct_problem wikiPageWikiLink IP_address.
- Count-distinct_problem wikiPageWikiLink IP_addresses.
- Count-distinct_problem wikiPageWikiLink Internet_Protocol.
- Count-distinct_problem wikiPageWikiLink Maximum_likelihood.
- Count-distinct_problem wikiPageWikiLink Minimum-variance_unbiased_estimator.
- Count-distinct_problem wikiPageWikiLink Philippe_Flajolet.
- Count-distinct_problem wikiPageWikiLink RFID.
- Count-distinct_problem wikiPageWikiLink Radio-frequency_identification.
- Count-distinct_problem wikiPageWikiLink Router_(computing).
- Count-distinct_problem wikiPageWikiLink Sensor_networks.
- Count-distinct_problem wikiPageWikiLink Streaming_algorithm.
- Count-distinct_problem wikiPageWikiLink Streaming_algorithms.
- Count-distinct_problem wikiPageWikiLink Unique_visitor.
- Count-distinct_problem wikiPageWikiLink Wireless_sensor_network.
- Count-distinct_problem wikiPageWikiLinkText "Count-distinct problem".
- Count-distinct_problem wikiPageWikiLinkText "count-distinct problem".
- Count-distinct_problem hasPhotoCollection Count-distinct_problem.
- Count-distinct_problem wikiPageUsesTemplate Template:Reflist.
- Count-distinct_problem subject Category:Statistical_algorithms.
- Count-distinct_problem hypernym Problem.
- Count-distinct_problem type Disease.
- Count-distinct_problem comment "In computer science, the count-distinct problem(also known in applied mathematics as the cardinality estimation problem) is the problem of finding the number of distinct elements in a data stream with repeated elements.This is a well-known problem with numerous applications. The elements might represent IP addresses of packets passing through a router, unique visitors to a web site, elements in a large database, motifs in a DNA sequence, or elements of RFID/sensor networks.".
- Count-distinct_problem label "Count-distinct problem".
- Count-distinct_problem sameAs m.0123nb1c.
- Count-distinct_problem sameAs Q18387786.
- Count-distinct_problem sameAs Q18387786.
- Count-distinct_problem wasDerivedFrom Count-distinct_problem?oldid=674474256.
- Count-distinct_problem isPrimaryTopicOf Count-distinct_problem.