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 *

148 related articles for article (PubMed ID: 18255796)

  • 1. Periodic symmetric functions, serial addition, and multiplication with neural networks.
    Cotofana S; Vassiliadis S
    IEEE Trans Neural Netw; 1998; 9(6):1118-28. PubMed ID: 18255796
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Binary higher order neural networks for realizing Boolean functions.
    Zhang C; Yang J; Wu W
    IEEE Trans Neural Netw; 2011 May; 22(5):701-13. PubMed ID: 21427020
    [TBL] [Abstract][Full Text] [Related]  

  • 3. On the Circuit Complexity of Sigmoid Feedforward Neural Networks.
    Taylor JG; Beiu V
    Neural Netw; 1996 Oct; 9(7):1155-1171. PubMed ID: 12662590
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. On the implementation of frontier-to-root tree automata in recursive neural networks.
    Gori M; Küchler A; Sperduti A
    IEEE Trans Neural Netw; 1999; 10(6):1305-14. PubMed ID: 18252632
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function.
    Akutsu T; Miyano S; Kuhara S
    J Comput Biol; 2000; 7(3-4):331-43. PubMed ID: 11108466
    [TBL] [Abstract][Full Text] [Related]  

  • 7. On the Representational Power of Restricted Boltzmann Machines for Symmetric Functions and Boolean Functions.
    Gu L; Huang J; Yang L
    IEEE Trans Neural Netw Learn Syst; 2019 May; 30(5):1335-1347. PubMed ID: 30281484
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Mapping Boolean functions with neural networks having binary weights and zero thresholds.
    Deolalikar V
    IEEE Trans Neural Netw; 2001; 12(3):639-42. PubMed ID: 18249898
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Identification of genetic networks from a small number of gene expression patterns under the Boolean network model.
    Akutsu T; Miyano S; Kuhara S
    Pac Symp Biocomput; 1999; ():17-28. PubMed ID: 10380182
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Trade-Offs Between Energy and Depth of Neural Networks.
    Uchizawa K; Abe H
    Neural Comput; 2024 Jul; 36(8):1541-1567. PubMed ID: 39028954
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Analog versus discrete neural networks.
    DasGupta B; Schnitger G
    Neural Comput; 1996 May; 8(4):805-18. PubMed ID: 8624961
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Artificial neural networks using complex numbers and phase encoded weights.
    Michel HE; Awwal AA
    Appl Opt; 2010 Apr; 49(10):B71-82. PubMed ID: 20357843
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions.
    Brandão LTAN; Çalık Ç; Turan MS; Peralta R
    Cryptogr Commun; 2019; 11(6):. PubMed ID: 32117514
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Universal perceptron and DNA-like learning algorithm for binary neural networks: non-LSBF implementation.
    Chen F; Chen G; He Q; He G; Xu X
    IEEE Trans Neural Netw; 2009 Aug; 20(8):1293-301. PubMed ID: 19589746
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Elementary function generators for neural-network emulators.
    Vassiliadis S; Zhang M; Delgado-Frias JG
    IEEE Trans Neural Netw; 2000; 11(6):1438-49. PubMed ID: 18249867
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Optimal approximation of piecewise smooth functions using deep ReLU neural networks.
    Petersen P; Voigtlaender F
    Neural Netw; 2018 Dec; 108():296-330. PubMed ID: 30245431
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Recurrent neural nets as dynamical Boolean systems with application to associative memory.
    Watta PB; Wang K; Hassoun MH
    IEEE Trans Neural Netw; 1997; 8(6):1268-80. PubMed ID: 18255729
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Continuous-time symmetric Hopfield nets are computationally universal.
    Síma J; Orponen P
    Neural Comput; 2003 Mar; 15(3):693-733. PubMed ID: 12620163
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.