메뉴 건너뛰기




Volumn 2, Issue , 2009, Pages 363-370

Cluster-Swap : A distributed k-median algorithm for sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE SOLUTION; COMMUNICATION COST; COMPUTATIONAL POWER; DISTRIBUTED ALGORITHM; ERROR BOUND; IN-BUILDINGS; INITIAL SOLUTION; K-MEDIAN; K-MEDIAN ALGORITHM; K-MEDIAN PROBLEM; LOCAL SEARCH HEURISTICS; MINIMAL COST; N-DIMENSIONAL SPACE; NODE SELECTION; OPTIMAL SOLUTIONS; POWER LIMITATIONS; RELATIVE LOCATION;

EID: 84863155000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WI-IAT.2009.178     Document Type: Conference Paper
Times cited : (1)

References (14)
  • 2
    • 1142279464 scopus 로고    scopus 로고
    • Distributed top-k monitoring
    • B. Babcock and C. Olston. Distributed top-k monitoring. In SIGMOD Conference, pages 28-39, 2003.
    • (2003) SIGMOD Conference , pp. 28-39
    • Babcock, B.1    Olston, C.2
  • 8
    • 4544303932 scopus 로고    scopus 로고
    • Coresets for k-means and k-median clustering and their applications
    • S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. In STOC, pages 291-300, 2004.
    • (2004) STOC , pp. 291-300
    • Har-Peled, S.1    Mazumdar, S.2
  • 11
    • 44649120234 scopus 로고    scopus 로고
    • A nearly linear-time approximation scheme for the euclidean k-median problem
    • Philadelphia, PA, USA. Society for Industrial and Applied Mathematics
    • S. G. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the euclidean k-median problem. In SIAM J. Comput., volume 37, pages 757-782, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
    • (2007) SIAM J. Comput. , vol.37 , pp. 757-782
    • Kolliopoulos, S.G.1    Rao, S.2
  • 13
    • 51349115211 scopus 로고    scopus 로고
    • Adding capacity points to a wireless mesh network using local search
    • J. Robinson, M. Uysal, R. Swaminathan, and E.W.Knightly. Adding capacity points to a wireless mesh network using local search. In INFOCOM, pages 1247-1255, 2008.
    • (2008) INFOCOM , pp. 1247-1255
    • Robinson, J.1    Uysal, M.2    Swaminathan, R.3    Knightly, E.W.4
  • 14
    • 34547902441 scopus 로고    scopus 로고
    • Approximate dynamic programming for communication-constrained sensor network management
    • J. L.Williams, J.W. Fisher, and A. S.Willsky. Approximate dynamic programming for communication-constrained sensor network management. Signal Processing, IEEE Transactions on, 55(8):4300-4311, 2007.
    • (2007) Signal Processing, IEEE Transactions on , vol.55 , Issue.8 , pp. 4300-4311
    • Williams, J.L.1    Fisher, J.W.2    Willsky, A.S.3


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