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 *

138 related articles for article (PubMed ID: 33670548)

  • 1. Near-Optimal Graph Signal Sampling by Pareto Optimization.
    Luo D; Si B; Zhang S; Yu F; Zhu J
    Sensors (Basel); 2021 Feb; 21(4):. PubMed ID: 33670548
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Sequential Sampling and Estimation of Approximately Bandlimited Graph Signals.
    Lin S; Xu K; Feng H; Hu B
    Sensors (Basel); 2021 Feb; 21(4):. PubMed ID: 33669801
    [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. Approximate Graph Edit Distance in Quadratic Time.
    Riesen K; Ferrer M; Bunke H
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Efficient and scalable Pareto optimization by evolutionary local selection algorithms.
    Menczer F; Degeratu M; Street WN
    Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522
    [TBL] [Abstract][Full Text] [Related]  

  • 6. 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]  

  • 7. 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]  

  • 8. Calculating complete and exact Pareto front for multiobjective optimization: a new deterministic approach for discrete problems.
    Hu XB; Wang M; Di Paolo E
    IEEE Trans Cybern; 2013 Jun; 43(3):1088-101. PubMed ID: 23193246
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Greedy Hypervolume Subset Selection in Low Dimensions.
    Guerreiro AP; Fonseca CM; Paquete L
    Evol Comput; 2016; 24(3):521-44. PubMed ID: 27303786
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Evolutionary Optimization of Expensive Multiobjective Problems With Co-Sub-Pareto Front Gaussian Process Surrogates.
    Luo J; Gupta A; Ong YS; Wang Z
    IEEE Trans Cybern; 2019 May; 49(5):1708-1721. PubMed ID: 29993877
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Graph Transform Optimization with Application to Image Compression.
    Fracastoro G; Thanou D; Frossard P
    IEEE Trans Image Process; 2019 Aug; ():. PubMed ID: 31403414
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 13. 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]  

  • 14. A Meta-Objective Approach for Many-Objective Evolutionary Optimization.
    Gong D; Liu Y; Yen GG
    Evol Comput; 2020; 28(1):1-25. PubMed ID: 30475673
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication.
    Hunt FY
    J Res Natl Inst Stand Technol; 2016; 121():180-195. PubMed ID: 34434619
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Derivative-free generation and interpolation of convex Pareto optimal IMRT plans.
    Hoffmann AL; Siem AY; den Hertog D; Kaanders JH; Huizenga H
    Phys Med Biol; 2006 Dec; 51(24):6349-69. PubMed ID: 17148822
    [TBL] [Abstract][Full Text] [Related]  

  • 18. DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction.
    Zhu M; Chen W; Hu Y; Hou Y; Liu L; Zhang K
    IEEE Trans Vis Comput Graph; 2021 Feb; 27(2):1666-1676. PubMed ID: 33275582
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Neural arbors are Pareto optimal.
    Chandrasekhar A; Navlakha S
    Proc Biol Sci; 2019 May; 286(1902):20182727. PubMed ID: 31039719
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A monotonic archive for pareto-coevolution.
    de Jong ED
    Evol Comput; 2007; 15(1):61-93. PubMed ID: 17388779
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.