Share to:

Template talk:Probabilistic

__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-212.87.13.71-2009-05-12T11:45:00.000Z","type":"heading","level":0,"id":"h-My_two_cents-2009-05-12T11:45:00.000Z","replies":["c-212.87.13.71-2009-05-12T11:45:00.000Z-My_two_cents"],"text":"My two cents","linkableTitle":"My two cents"}-->

My two cents

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-212.87.13.71-2009-05-12T11:45:00.000Z","type":"heading","level":0,"id":"h-My_two_cents-2009-05-12T11:45:00.000Z","replies":["c-212.87.13.71-2009-05-12T11:45:00.000Z-My_two_cents"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-212.87.13.71-2009-05-12T11:45:00.000Z","type":"heading","level":0,"id":"h-My_two_cents-2009-05-12T11:45:00.000Z","replies":["c-212.87.13.71-2009-05-12T11:45:00.000Z-My_two_cents"],"text":"My two cents","linkableTitle":"My two cents"}-->

My two cents: I understand that approximate counting might be too specific to be put here (for me it isn't), but it is clearly a data structure - a counter offering get and increase methods. I don't know why Wikipedia classifies it as an algorithm.

It doesn't fit many algorithm characterizations, e.g.:

"A computation is a process whereby we proceed from initially given objects, called inputs, according to a fixed set of rules, called a program, procedure, or algorithm, through a series of steps and arrive at the end of these steps with a final result, called the output."

What is input to it? The counter is gradually increased - operations done inside the counter and outside it are interlaced. Most definitions require that an algorithm runs uninterrupted - given input it performs some steps and returns output. One could give the number of times to increase, but this defeats the purpose of the counter - to have small space requirements.

It could be seen as an on-line algorithm, but every data structure can be regarded as such. 212.87.13.71 (talk) 11:45, 12 May 2009 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2009-05-12T11:45:00.000Z","author":"212.87.13.71","type":"comment","level":1,"id":"c-212.87.13.71-2009-05-12T11:45:00.000Z-My_two_cents","replies":[]}}-->

__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-Saung_Tadashi-2021-08-11T13:51:00.000Z","type":"heading","level":0,"id":"h-Adding_Cuckoo_filter_to_probabilistic_data_structures-2021-08-11T13:51:00.000Z","replies":["c-Saung_Tadashi-2021-08-11T13:51:00.000Z-Adding_Cuckoo_filter_to_probabilistic_data_structures"],"text":"Adding Cuckoo filter to probabilistic data structures","linkableTitle":"Adding Cuckoo filter to probabilistic data structures"}-->

Adding Cuckoo filter to probabilistic data structures

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-Saung_Tadashi-2021-08-11T13:51:00.000Z","type":"heading","level":0,"id":"h-Adding_Cuckoo_filter_to_probabilistic_data_structures-2021-08-11T13:51:00.000Z","replies":["c-Saung_Tadashi-2021-08-11T13:51:00.000Z-Adding_Cuckoo_filter_to_probabilistic_data_structures"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-Saung_Tadashi-2021-08-11T13:51:00.000Z","type":"heading","level":0,"id":"h-Adding_Cuckoo_filter_to_probabilistic_data_structures-2021-08-11T13:51:00.000Z","replies":["c-Saung_Tadashi-2021-08-11T13:51:00.000Z-Adding_Cuckoo_filter_to_probabilistic_data_structures"],"text":"Adding Cuckoo filter to probabilistic data structures","linkableTitle":"Adding Cuckoo filter to probabilistic data structures"}-->

I think Cuckoo filter should be a nice addition to the infobox :) Saung Tadashi (talk) 13:51, 11 August 2021 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2021-08-11T13:51:00.000Z","author":"Saung Tadashi","type":"comment","level":1,"id":"c-Saung_Tadashi-2021-08-11T13:51:00.000Z-Adding_Cuckoo_filter_to_probabilistic_data_structures","replies":[]}}-->

Kembali kehalaman sebelumnya