Data association based on optimization in graphical models with application to sensor networks (Q2473188): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Information processing in sensor networks. Second international workshop, IPSN 2003, Palo Alto, CA, USA, April 22--23, 2003. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tracking and data association / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Networks and Expert Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning low-level vision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiscale recursive estimation, data fusion, and regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-based reparameterization framework for analysis of sum-product and related algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized distributive law / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor graphs and the sum-product algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3293678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank

Latest revision as of 18:02, 27 June 2024

scientific article
Language Label Description Also known as
English
Data association based on optimization in graphical models with application to sensor networks
scientific article

    Statements

    Data association based on optimization in graphical models with application to sensor networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 February 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references