%0 Conference Paper %1 conf/csse/PingdaH08 %A Shu, Pingda %A Chen, Huahui %B CSSE (4) %D 2008 %I IEEE Computer Society %K dblp %P 267-270 %T A New Method to Find Top K Items in Data Streams at Arbitrary Time Granularities. %U http://dblp.uni-trier.de/db/conf/csse/csse2008-4.html#PingdaH08

@inproceedings{conf/csse/PingdaH08, added-at = {2023-03-23T00:00:00.000+0100}, author = {Shu, Pingda and Chen, Huahui}, biburl = {https://www.bibsonomy.org/bibtex/2b3a81c44cc857bc6ce3b5cc0aa230cfa/dblp}, booktitle = {CSSE (4)}, crossref = {conf/csse/2008-4}, ee = {https://doi.ieeecomputersociety.org/10.1109/CSSE.2008.973}, interhash = {7b3c32b59d4a87cdfb175de4c6c38aae}, intrahash = {b3a81c44cc857bc6ce3b5cc0aa230cfa}, keywords = {dblp}, note = {978-0-7695-3336-0}, pages = {267-270}, publisher = {IEEE Computer Society}, timestamp = {2024-04-09T21:41:05.000+0200}, title = {A New Method to Find Top K Items in Data Streams at Arbitrary Time Granularities.}, url = {http://dblp.uni-trier.de/db/conf/csse/csse2008-4.html#PingdaH08}, year = 2008 }