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 *

527 related articles for article (PubMed ID: 19834143)

  • 1. A path following algorithm for the graph matching problem.
    Zaslavskiy M; Bach F; Vert JP
    IEEE Trans Pattern Anal Mach Intell; 2009 Dec; 31(12):2227-42. PubMed ID: 19834143
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Learning graph matching.
    Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ
    IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Graphical models and point pattern matching.
    Caetano TS; Caelli T; Schuurmans D; Barone DA
    IEEE Trans Pattern Anal Mach Intell; 2006 Oct; 28(10):1646-63. PubMed ID: 16986545
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A binary linear programming formulation of the graph edit distance.
    Justice D; Hero A
    IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Matching by linear programming and successive convexification.
    Jiang H; Drew MS; Li ZN
    IEEE Trans Pattern Anal Mach Intell; 2007 Jun; 29(6):959-75. PubMed ID: 17431296
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Robust point matching for nonrigid shapes by preserving local neighborhood structures.
    Zheng Y; Doermann D
    IEEE Trans Pattern Anal Mach Intell; 2006 Apr; 28(4):643-9. PubMed ID: 16566512
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An efficient Earth Mover's Distance algorithm for robust histogram comparison.
    Ling H; Okada K
    IEEE Trans Pattern Anal Mach Intell; 2007 May; 29(5):840-53. PubMed ID: 17356203
    [TBL] [Abstract][Full Text] [Related]  

  • 9. An efficient and accurate method for the relaxation of multiview registration error.
    Shih SW; Chuang YT; Yu TY
    IEEE Trans Image Process; 2008 Jun; 17(6):968-81. PubMed ID: 18482891
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms.
    Carretero JA; Nahon MA
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1144-55. PubMed ID: 16366241
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Graph rigidity, cyclic belief propagation, and point pattern matching.
    McAuley JJ; Caetano TS; Barbosa MS
    IEEE Trans Pattern Anal Mach Intell; 2008 Nov; 30(11):2047-54. PubMed ID: 18787251
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Weighted graph cuts without eigenvectors a multilevel approach.
    Dhillon IS; Guan Y; Kulis B
    IEEE Trans Pattern Anal Mach Intell; 2007 Nov; 29(11):1944-57. PubMed ID: 17848776
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Path similarity skeleton graph matching.
    Bai X; Latecki LJ
    IEEE Trans Pattern Anal Mach Intell; 2008 Jul; 30(7):1282-92. PubMed ID: 18550909
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An eigenspace projection clustering method for inexact graph matching.
    Caelli T; Kosinov S
    IEEE Trans Pattern Anal Mach Intell; 2004 Apr; 26(4):515-9. PubMed ID: 15382655
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Using stereo matching with general epipolar geometry for 2D face recognition across pose.
    Castillo CD; Jacobs DW
    IEEE Trans Pattern Anal Mach Intell; 2009 Dec; 31(12):2298-304. PubMed ID: 19834149
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Graph cuts via l1 norm minimization.
    Bhusnurmath A; Taylor CJ
    IEEE Trans Pattern Anal Mach Intell; 2008 Oct; 30(10):1866-71. PubMed ID: 18703837
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A multiresolution stochastic level set method for Mumford-Shah image segmentation.
    Law YN; Lee HK; Yip AM
    IEEE Trans Image Process; 2008 Dec; 17(12):2289-300. PubMed ID: 19004702
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Correspondence propagation with weak priors.
    Wang H; Yan S; Liu J; Tang X; Huang TS
    IEEE Trans Image Process; 2009 Jan; 18(1):140-50. PubMed ID: 19095525
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Dynamic graph cuts for efficient inference in Markov Random Fields.
    Kohli P; Torr PH
    IEEE Trans Pattern Anal Mach Intell; 2007 Dec; 29(12):2079-88. PubMed ID: 17934219
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Convolutional networks can learn to generate affinity graphs for image segmentation.
    Turaga SC; Murray JF; Jain V; Roth F; Helmstaedter M; Briggman K; Denk W; Seung HS
    Neural Comput; 2010 Feb; 22(2):511-38. PubMed ID: 19922289
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 27.