• DocumentCode
    2630849
  • Title

    On positioning via distributed matrix completion

  • Author

    Montanari, Andrea ; Oh, Sewoong

  • Author_Institution
    EE & Stat. Depts., Stanford Univ., Stanford, CA, USA
  • fYear
    2010
  • fDate
    4-7 Oct. 2010
  • Firstpage
    197
  • Lastpage
    200
  • Abstract
    The basic question in matrix completion is to infer a large low-rank matrix from a small subset of its entries. Positioning refers to the task of inferring the locations of n points from a subset of their distance. It turns out that positioning can be viewed as a matrix completion problem, although of a peculiar type. This paper discusses the applicability of distributed matrix completion algorithms to the positioning problem.
  • Keywords
    matrix algebra; sensor placement; distributed matrix completion algorithms; low-rank matrix; positioning problem; Accuracy; Ad hoc networks; Complexity theory; Eigenvalues and eigenfunctions; Manifolds; Presses; Symmetric matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sensor Array and Multichannel Signal Processing Workshop (SAM), 2010 IEEE
  • Conference_Location
    Jerusalem
  • ISSN
    1551-2282
  • Print_ISBN
    978-1-4244-8978-7
  • Electronic_ISBN
    1551-2282
  • Type

    conf

  • DOI
    10.1109/SAM.2010.5606732
  • Filename
    5606732
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2630849