Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window

Author： Ting Hing-Fung   Lee Lap-Kei   Chan Ho-Leung   Lam Tak-Wah  

Publisher： MDPI

E-ISSN： 1999-4893|4|3|200-222

ISSN： 1999-4893

Source： Algorithms, Vol.4, Iss.3, 2011-09, pp. : 200-222

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximating the Minimum Tour Cover of a Digraph

By Nguyen Viet Hung  

Algorithms, Vol. 4, Iss. 1, 2011-04 ,pp. : 75-86

MDPI

Access to resources Recommend Favorite

Monitoring Threshold Functions over Distributed Data Streams with Node Dependent Constraints

By Malinovsky Yaakov   Kogan Jacob  

Algorithms, Vol. 5, Iss. 3, 2012-09 ,pp. : 379-397

MDPI

Access to resources Recommend Favorite

Comparison of Different Neural Network Approaches for the Tropospheric Profiling over the Inter-tropical lands Using GPS Radio Occultation Data

By Bonafoni Stefania   Pelliccia Fabrizio   Anniballe Roberta  

Algorithms, Vol. 2, Iss. 1, 2009-01 ,pp. : 31-45

MDPI

Access to resources Recommend Favorite

An Asynchronous Message-Passing Distributed Algorithm for the Generalized Local Critical Section Problem †

By Kamei Sayaka   Kakugawa Hirotsugu  

Algorithms, Vol. 10, Iss. 2, 2017-03 ,pp. : 38-38

MDPI

Access to resources Recommend Favorite

Numerical Properties of Different Root-Finding Algorithms Obtained for Approximating Continuous Newton’s Method

By Gutiérrez José M.  

Algorithms, Vol. 8, Iss. 4, 2015-12 ,pp. : 1210-1218

MDPI

Access to resources Recommend Favorite