These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

113 related articles for article (PubMed ID: 26352452)

  • 1. Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings.
    Werner T
    IEEE Trans Pattern Anal Mach Intell; 2015 Jul; 37(7):1455-68. PubMed ID: 26352452
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Ideals and their complements in commutative semirings.
    Chajda I; Länger H
    Soft comput; 2019; 23(14):5385-5392. PubMed ID: 31258389
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Revisiting the linear programming relaxation approach to Gibbs energy minimization and weighted constraint satisfaction.
    Werner T
    IEEE Trans Pattern Anal Mach Intell; 2010 Aug; 32(8):1474-88. PubMed ID: 20558878
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A linear programming approach to max-sum problem: a review.
    Werner T
    IEEE Trans Pattern Anal Mach Intell; 2007 Jul; 29(7):1165-79. PubMed ID: 17496375
    [TBL] [Abstract][Full Text] [Related]  

  • 5. The Rényi Entropies Operate in Positive Semifields.
    Valverde-Albacete FJ; Peláez-Moreno C
    Entropy (Basel); 2019 Aug; 21(8):. PubMed ID: 33267493
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Convergent tree-reweighted message passing for energy minimization.
    Kolmogorov V
    IEEE Trans Pattern Anal Mach Intell; 2006 Oct; 28(10):1568-83. PubMed ID: 16986540
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Estimation and marginalization using the Kikuchi approximation methods.
    Pakzad P; Anantharam V
    Neural Comput; 2005 Aug; 17(8):1836-73. PubMed ID: 15969920
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Learning multivariate distributions by competitive assembly of marginals.
    Sánchez-Vega F; Younes L; Geman D
    IEEE Trans Pattern Anal Mach Intell; 2013 Feb; 35(2):398-410. PubMed ID: 22529323
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Learning factorizations in estimation of distribution algorithms using affinity propagation.
    Santana R; Larrañaga P; Lozano JA
    Evol Comput; 2010; 18(4):515-46. PubMed ID: 20583913
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Linear response algorithms for approximate inference in graphical models.
    Welling M; Teh YW
    Neural Comput; 2004 Jan; 16(1):197-221. PubMed ID: 15006029
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Fixed Points of Belief Propagation-An Analysis via Polynomial Homotopy Continuation.
    Knoll C; Mehta D; Chen T; Pernkopf F
    IEEE Trans Pattern Anal Mach Intell; 2018 Sep; 40(9):2124-2136. PubMed ID: 28885150
    [TBL] [Abstract][Full Text] [Related]  

  • 12. [Experience in repair of cervical trachea frame with semirings made of rib autocartilage].
    Bystrenin AV
    Vestn Otorinolaringol; 2005; (1):41-3. PubMed ID: 15700009
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Learning graphical model parameters with approximate marginal inference.
    Domke J
    IEEE Trans Pattern Anal Mach Intell; 2013 Oct; 35(10):2454-67. PubMed ID: 23969389
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Join-Graph Propagation Algorithms.
    Mateescu R; Kask K; Gogate V; Dechter R
    J Artif Intell Res; 2010 Jan; 37():279-328. PubMed ID: 20740057
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Nonlinear optical components for all-optical probabilistic graphical model.
    Babaeian M; Blanche PA; Norwood RA; Kaplas T; Keiffer P; Svirko Y; Allen TG; Chen VW; Chi SH; Perry JW; Marder SR; Neifeld MA; Peyghambarian N
    Nat Commun; 2018 May; 9(1):2128. PubMed ID: 29844343
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Learning unbelievable probabilities.
    Pitkow X; Ahmadian Y; Miller KD
    Adv Neural Inf Process Syst; 2011 Dec; 24():738-746. PubMed ID: 28781497
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A scalable projective scaling algorithm for l(p) loss with convex penalizations.
    Zhou H; Cheng Q
    IEEE Trans Neural Netw Learn Syst; 2015 Feb; 26(2):265-76. PubMed ID: 25608289
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An enhanced branch-and-bound algorithm for a partitioning problem.
    Brusco MJ
    Br J Math Stat Psychol; 2003 May; 56(Pt 1):83-92. PubMed ID: 12803823
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Gauge-free cluster variational method by maximal messages and moment matching.
    Domínguez E; Lage-Castellanos A; Mulet R; Ricci-Tersenghi F
    Phys Rev E; 2017 Apr; 95(4-1):043308. PubMed ID: 28505804
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A comparison of algorithms for inference and learning in probabilistic graphical models.
    Frey BJ; Jojic N
    IEEE Trans Pattern Anal Mach Intell; 2005 Sep; 27(9):1392-416. PubMed ID: 16173184
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.