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 *

110 related articles for article (PubMed ID: 17052161)

  • 1. An upper bound on the minimum number of monomials required to separate dichotomies of {-1, 1}n.
    Oztop E
    Neural Comput; 2006 Dec; 18(12):3119-38. PubMed ID: 17052161
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Sign-representation of Boolean functions using a small number of monomials.
    Oztop E
    Neural Netw; 2009 Sep; 22(7):938-48. PubMed ID: 19423284
    [TBL] [Abstract][Full Text] [Related]  

  • 3. On the capabilities of higher-order neurons: a radial basis function approach.
    Schmitt M
    Neural Comput; 2005 Mar; 17(3):715-29. PubMed ID: 15802012
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Bounds on the number of hidden neurons in three-layer binary neural networks.
    Zhang Z; Ma X; Yang Y
    Neural Netw; 2003 Sep; 16(7):995-1002. PubMed ID: 14692634
    [TBL] [Abstract][Full Text] [Related]  

  • 5. General-purpose computation with neural networks: a survey of complexity theoretic results.
    Síma J; Orponen P
    Neural Comput; 2003 Dec; 15(12):2727-78. PubMed ID: 14629867
    [TBL] [Abstract][Full Text] [Related]  

  • 6. On the nonlearnability of a single spiking neuron.
    Síma J; Sgall J
    Neural Comput; 2005 Dec; 17(12):2635-47. PubMed ID: 16212765
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Training a single sigmoidal neuron is hard.
    Síma J
    Neural Comput; 2002 Nov; 14(11):2709-28. PubMed ID: 12433296
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On the complexity of computing and learning with multiplicative neural networks.
    Schmitt M
    Neural Comput; 2002 Feb; 14(2):241-301. PubMed ID: 11802913
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A learning rule for very simple universal approximators consisting of a single layer of perceptrons.
    Auer P; Burgsteiner H; Maass W
    Neural Netw; 2008 Jun; 21(5):786-95. PubMed ID: 18249524
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Accelerating event-driven simulation of spiking neurons with multiple synaptic time constants.
    D'Haene M; Schrauwen B; Van Campenhout J; Stroobandt D
    Neural Comput; 2009 Apr; 21(4):1068-99. PubMed ID: 18928367
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Multiple almost periodic solutions in nonautonomous delayed neural networks.
    Lin KH; Shih CW
    Neural Comput; 2007 Dec; 19(12):3392-420. PubMed ID: 17970659
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Complete stability in multistable delayed neural networks.
    Cheng CY; Shih CW
    Neural Comput; 2009 Mar; 21(3):719-40. PubMed ID: 18928363
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Generalized neuron: feedforward and recurrent architectures.
    Kulkarni RV; Venayagamoorthy GK
    Neural Netw; 2009 Sep; 22(7):1011-7. PubMed ID: 19660907
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Further results in multiset processing with neural networks.
    McGregor S
    Neural Netw; 2008 Aug; 21(6):830-7. PubMed ID: 18667291
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A quantitative theory of neural computation.
    Valiant LG
    Biol Cybern; 2006 Sep; 95(3):205-11. PubMed ID: 16763793
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Synergies between intrinsic and synaptic plasticity mechanisms.
    Triesch J
    Neural Comput; 2007 Apr; 19(4):885-909. PubMed ID: 17348766
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An extended model for a spiking neuron class.
    Guerreiro AM; Paz de Araujo CA
    Biol Cybern; 2007 Sep; 97(3):211-9. PubMed ID: 17647011
    [TBL] [Abstract][Full Text] [Related]  

  • 19. On the classification capability of sign-constrained perceptrons.
    Legenstein R; Maass W
    Neural Comput; 2008 Jan; 20(1):288-309. PubMed ID: 18045010
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the nearest neighbour interchange distance between evolutionary trees.
    Li M; Tromp J; Zhang L
    J Theor Biol; 1996 Oct; 182(4):463-7. PubMed ID: 8944893
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.