메뉴 건너뛰기




Volumn , Issue , 2005, Pages 163-172

Detection and tracking of discrete phenomena in sensor-network databases

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE SELECTION; CONTINUOUS QUERIES; DETECTION AND TRACKING; DISCRETE PHENOMENA; NETWORK DATABASE; PERFORMANCE GAIN; SENSOR READINGS; SYSTEM RESOURCES;

EID: 84883244633     PISSN: 10993371     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (19)

References (19)
  • 2
    • 0035964959 scopus 로고    scopus 로고
    • An implementation of the iterative proportional fitting procedure by propagation trees
    • J.-H. Badsberg and F. M. Malvestuto. An implementation of the iterative proportional fitting procedure by propagation trees. Computational Statistics and Data Analysis, 37:297- 322, 2001.
    • (2001) Computational Statistics and Data Analysis , vol.37 , pp. 297-322
    • Badsberg, J.-H.1    Malvestuto, F.M.2
  • 4
    • 0020782108 scopus 로고
    • On the desirability of acyclic database schemes
    • D. M. C. Beeri, R. Fagin and M. Yannakakis. On the desirability of acyclic database schemes. Journal of ACM, 30:479-513, 1983.
    • (1983) Journal of ACM , vol.30 , pp. 479-513
    • Beeri, D.M.C.1    Fagin, R.2    Yannakakis, M.3
  • 6
    • 0344811122 scopus 로고    scopus 로고
    • An overview of data warehousing and olap technology
    • S. Chauduri and U. Dayal. An overview of data warehousing and olap technology. ACM SIGMOD Record, 26:65-74, 1997.
    • (1997) ACM SIGMOD Record , vol.26 , pp. 65-74
    • Chauduri, S.1    Dayal, U.2
  • 7
    • 0000546609 scopus 로고
    • I-divergence geometry of probability distributions and minimization problems
    • I. Csisźar. I-divergence geometry of probability distributions and minimization problems. The Annals of Probability, 3:146-158, 1975.
    • (1975) The Annals of Probability , vol.3 , pp. 146-158
    • Csisźar, I.1
  • 8
    • 0000695960 scopus 로고
    • On a least square adjustment of a sampled frequency table when the expected marginal totals are known
    • W. E. Deming and F. F. Stephan. On a least square adjustment of a sampled frequency table when the expected marginal totals are known. Annals of Mathematical Statistics, 11:427-444, 1940.
    • (1940) Annals of Mathematical Statistics , vol.11 , pp. 427-444
    • Deming, W.E.1    Stephan, F.F.2
  • 12
    • 0024753107 scopus 로고
    • A universal table model for categorical databases
    • F. M. Malvestuto. A universal table model for categorical databases. Information Sciences, 49:203-223, 1989.
    • (1989) Information Sciences , vol.49 , pp. 203-223
    • Malvestuto, F.M.1
  • 13
    • 0027874192 scopus 로고
    • A universal - scheme approach to statistical databases containing homogeneous summary tables
    • F. M. Malvestuto. A universal - scheme approach to statistical databases containing homogeneous summary tables. ACM Trans. on Database Systems, 18:678-708, 1993.
    • (1993) ACM Trans. on Database Systems , vol.18 , pp. 678-708
    • Malvestuto, F.M.1
  • 14
    • 0042379704 scopus 로고    scopus 로고
    • A hypergraph-theoretic analysis of collapsibility and decomposability for extended log-linear models
    • F. M. Malvestuto. A hypergraph-theoretic analysis of collapsibility and decomposability for extended log-linear models. Statistics and Computing, 11:155-169, 2001.
    • (2001) Statistics and Computing , vol.11 , pp. 155-169
    • Malvestuto, F.M.1
  • 15
    • 0032089769 scopus 로고    scopus 로고
    • A fast algorithm for query optimization in universal-relation databases.
    • F. M. Malvestuto and M. Moscarini. A fast algorithm for query optimization in universal-relation databases. J. Computer and System Sciences, 56:299-309, 1998.
    • (1998) J. Computer and System Sciences , vol.56 , pp. 299-309
    • Malvestuto, F.M.1    Moscarini, M.2
  • 16
    • 0042209519 scopus 로고    scopus 로고
    • Decomposition of a hypergraph by partial-edge separators
    • F. M. Malvestuto and M. Moscarini. Decomposition of a hypergraph by partial-edge separators. Theoretical Computer Science, 237:57-79, 2000.
    • (2000) Theoretical Computer Science , vol.237 , pp. 57-79
    • Malvestuto, F.M.1    Moscarini, M.2
  • 18
    • 0003707707 scopus 로고
    • A computable model for economic growth
    • Chapman and Hall, London
    • R. Stone and A. Brown. A Computable Model for Economic Growth, A Programme for Growth No.1. Chapman and Hall, London, 1962.
    • (1962) A Programme for Growth , Issue.1
    • Stone, R.1    Brown, A.2
  • 19
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce hypergraphs
    • R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce hypergraphs. SIAM J. on Computing, 13:566-579, 1984.
    • (1984) SIAM J. on Computing , vol.13 , pp. 566-579
    • Tarjan, R.E.1    Yannakakis, M.2


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