메뉴 건너뛰기




Volumn , Issue , 2006, Pages 280-289

Deterministic k-set structure

Author keywords

Data streams; K set structure

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; MOBILE COMPUTING;

EID: 34250651737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142392     Document Type: Conference Paper
Times cited : (11)

References (17)
  • 1
    • 84873894669 scopus 로고    scopus 로고
    • LAPACK:, Available from
    • "LAPACK: The Linear Algebra Package". Available from "www.netlib.org/LAPACK".
    • The Linear Algebra Package
  • 4
    • 35048819960 scopus 로고    scopus 로고
    • An improved data, stream summary: The Count-Min sketch and its applications
    • G. Cormode and S. Muthukrishnan. "An improved data, stream summary: The Count-Min sketch and its applications". In Proc. LATIN, pages 29-38, 2004.
    • (2004) Proc. LATIN , pp. 29-38
    • Cormode, G.1    Muthukrishnan, S.2
  • 5
    • 1142305378 scopus 로고    scopus 로고
    • What's Hot and What's Not: Tracking Most Frequent Items Dynamically
    • Graham Cormode and S. Muthukrishnan. "What's Hot and What's Not: Tracking Most Frequent Items Dynamically". In Proc. ACM PODS, pages 296-306, 2003.
    • (2003) Proc. ACM PODS , pp. 296-306
    • Cormode, G.1    Muthukrishnan, S.2
  • 7
    • 33744954917 scopus 로고    scopus 로고
    • Counting distinct items over update streams
    • Sumit Ganguly. "Counting distinct items over update streams". In Proc. ISAAC, pages 505-514, 2005.
    • (2005) Proc. ISAAC , pp. 505-514
    • Ganguly, S.1
  • 8
    • 33746339407 scopus 로고    scopus 로고
    • Deterministic algorithm for estimating heavy-hitters on Turnstile data streams
    • Manuscript
    • L. Gasieniec and S. Muthukrishnan. "Deterministic algorithm for estimating heavy-hitters on Turnstile data streams". Manuscript, 2005.
    • (2005)
    • Gasieniec, L.1    Muthukrishnan, S.2
  • 11
    • 34250661648 scopus 로고    scopus 로고
    • The Mathworks, Natick, MA, USA. MATLAB 7.1.
    • The Mathworks, Natick, MA, USA. "MATLAB 7.1".
  • 12
    • 0041779657 scopus 로고    scopus 로고
    • Set Reconciliation with Nearly Optimal Communication Complexity
    • Y. Minsky, A. Trachtenberg, and R. Zippel. "Set Reconciliation with Nearly Optimal Communication Complexity". IEEE Trans. Inf. Theory, 49(9):2213-2218, 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , Issue.9 , pp. 2213-2218
    • Minsky, Y.1    Trachtenberg, A.2    Zippel, R.3
  • 15
    • 0025430451 scopus 로고
    • Scalable, Secure, and Highly Available Distributed File Access
    • May
    • M. Satyamarayanan. "Scalable, Secure, and Highly Available Distributed File Access". IEEE Computer, 23(5), May 1990.
    • (1990) IEEE Computer , vol.23 , Issue.5
    • Satyamarayanan, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.