메뉴 건너뛰기




Volumn , Issue , 2007, Pages 386-395

Clustering wavelets to speed-up data dissemination in structured P2P MANETs

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS; MOBILE DEVICES; PATTERN RECOGNITION; USER INTERFACES; WAVELET ANALYSIS;

EID: 34548779083     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367884     Document Type: Conference Paper
Times cited : (7)

References (26)
  • 3
    • 0039253822 scopus 로고    scopus 로고
    • C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional spaces. In Proc. of SIGMOD Conf., 2000.
    • C. Aggarwal and P. S. Yu. Finding generalized projected clusters in high dimensional spaces. In Proc. of SIGMOD Conf., 2000.
  • 4
    • 0032090765 scopus 로고    scopus 로고
    • Automatic subspace clustering of high dimensional data for data mining applications
    • R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. of SIGMOD Conf., 1998.
    • (1998) Proc. of SIGMOD Conf
    • Agrawal, R.1    Gehrke, J.2    Gunopulos, D.3    Raghavan, P.4
  • 6
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of ACM, 13(7), 1970.
    • (1970) Communications of ACM , vol.13 , Issue.7
    • Bloom, B.1
  • 8
    • 34548720427 scopus 로고    scopus 로고
    • T. Darrell, P. Indyk, and G. Shakhnarovich, editors. Locality- sensitive hashing using stable distributions. MIT Press, to appear.
    • T. Darrell, P. Indyk, and G. Shakhnarovich, editors. Locality- sensitive hashing using stable distributions. MIT Press, to appear.
  • 9
    • 0003833285 scopus 로고
    • Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
    • I. Daubechies. Ten lectures on wavelets. Society for Industrial and Applied Mathematics, Philadelphia, PA., USA, 1992.
    • (1992) Ten lectures on wavelets
    • Daubechies, I.1
  • 10
    • 0002878444 scopus 로고    scopus 로고
    • Feature subset selection and order identification for unsupervised learning
    • J. G. Dy and C. E. Brodley. Feature subset selection and order identification for unsupervised learning. In Proc. of ICML, 2000.
    • (2000) Proc. of ICML
    • Dy, J.G.1    Brodley, C.E.2
  • 11
    • 84976803260 scopus 로고
    • FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
    • C. Faloutsos and K.-I. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proc. of SIGMOD Conf., 1995.
    • (1995) Proc. of SIGMOD Conf
    • Faloutsos, C.1    Lin, K.-I.2
  • 15
    • 33745630382 scopus 로고    scopus 로고
    • Baton: A balanced tree structure for peer-to-peer networks
    • H. V. Jagadish, B. C. Ooi, and Q. H. Vu, Baton: A balanced tree structure for peer-to-peer networks. In Proc. of VLDB Conf., 2005.
    • (2005) Proc. of VLDB Conf
    • Jagadish, H.V.1    Ooi, B.C.2    Vu, Q.H.3
  • 16
    • 33749626994 scopus 로고    scopus 로고
    • Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes
    • H.V. Jagadish, B. C. Ooi, Q. H. Vu, Z. Rong, and A. Zhou. Vbi-tree: A peer-to-peer framework for supporting multi-dimensional indexing schemes. In Proc. of ICDE, 2006.
    • (2006) Proc. of ICDE
    • Jagadish, H.V.1    Ooi, B.C.2    Vu, Q.H.3    Rong, Z.4    Zhou, A.5
  • 19
    • 0003136237 scopus 로고
    • Efficient and effective clustering methods for spatial data mining
    • R. T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In Proc. of VLDB Conf., 1994.
    • (1994) Proc. of VLDB Conf
    • Ng, R.T.1    Han, J.2
  • 20
    • 34548801400 scopus 로고    scopus 로고
    • S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proc. of SIGCOMM Conf., 2001.
    • S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proc. of SIGCOMM Conf., 2001.
  • 21
    • 84997637171 scopus 로고
    • Efficient color histogram indexing
    • H. Shawney and J. Hafner. Efficient color histogram indexing. In Proc. of ICIP, 1994.
    • (1994) Proc. of ICIP
    • Shawney, H.1    Hafner, J.2
  • 22
    • 0003052357 scopus 로고    scopus 로고
    • Wavecluster: A multi-resolution clustering approach for very large spatial databases
    • G. Sheikholeslami, S. Chatterjee, and A. Zhang. Wavecluster: A multi-resolution clustering approach for very large spatial databases. In Proc. of VLDB Conf., 1998.
    • (1998) Proc. of VLDB Conf
    • Sheikholeslami, G.1    Chatterjee, S.2    Zhang, A.3
  • 23
    • 29844453532 scopus 로고    scopus 로고
    • Towards effective indexing for very large video sequence database
    • H. T. Shen, B. G. Ooi, and X. Zhou. Towards effective indexing for very large video sequence database. In Proc. of SIGMOD Conf., 2005.
    • (2005) Proc. of SIGMOD Conf
    • Shen, H.T.1    Ooi, B.G.2    Zhou, X.3
  • 24
    • 13844298845 scopus 로고    scopus 로고
    • An efficient cost model for optimization of nearest neighbor search for low and medium dimensional spaces
    • Y. Tao, J. Zhang, D. Papadias, and N. Mamoulis. An efficient cost model for optimization of nearest neighbor search for low and medium dimensional spaces. IEEE TKDE, 16(10), 2004.
    • (2004) IEEE TKDE , vol.16 , Issue.10
    • Tao, Y.1    Zhang, J.2    Papadias, D.3    Mamoulis, N.4
  • 26
    • 0036648502 scopus 로고    scopus 로고
    • Musical genre classification of audio signals
    • G. Tzanetakis and P. Cook. Musical genre classification of audio signals. IEEE TSAP, 10(5), 2002.
    • (2002) IEEE TSAP , vol.10 , Issue.5
    • Tzanetakis, G.1    Cook, P.2


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