Paul C. Kainen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2021

A New View of Hypercube GenusRichard H. Hammack, Paul C. Kainen. tamm, 128(4):352-359, 2021. [doi]

2020

Sphere decompositions of hypercubesRichard H. Hammack, Paul C. Kainen. adam, 3(2), 2020. [doi]

On 2-skeleta of hypercubesPaul C. Kainen. adam, 3(2), 2020. [doi]

Approximative compactness of linear combinations of characteristic functionsPaul C. Kainen, Vera Kurková, Andrew Vogt. jat, 257:105435, 2020. [doi]

2018

Robust cycle bases do not exist for ifRichard H. Hammack, Paul C. Kainen. DAM, 235:206-211, 2018. [doi]

Graph Bases and Diagram CommutativityRichard H. Hammack, Paul C. Kainen. gc, 34(4):523-534, 2018. [doi]

2015

Cycle construction and geodesic cycles with application to the hypercubePaul C. Kainen. arsmc, 9(1):27-43, 2015. [doi]

2014

Comparing fixed and variable-width Gaussian networksVera Kurková, Paul C. Kainen. NN, 57:23-28, 2014. [doi]

2013

Bochner Integrals and Neural NetworksPaul C. Kainen, Andrew Vogt. In Monica Bianchini, Marco Maggini, Lakhmi C. Jain, editors, Handbook on Neural Information Processing. Volume 49 of Intelligent Systems Reference Library, pages 183-214, Springer, 2013. [doi]

Approximating Multivariable Functions by Feedforward Neural NetsPaul C. Kainen, Vera Kurková, Marcello Sanguineti. In Monica Bianchini, Marco Maggini, Lakhmi C. Jain, editors, Handbook on Neural Information Processing. Volume 49 of Intelligent Systems Reference Library, pages 143-181, Springer, 2013. [doi]

2012

Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization TasksPaul C. Kainen, Vera Kurková, Marcello Sanguineti. TIT, 58(2):1203-1214, 2012. [doi]

2011

Kernel Networks with Fixed and Variable WidthsVera Kurková, Paul C. Kainen. icannga 2011: 12-21 [doi]

2009

An Integral Upper Bound for Neural Network ApproximationPaul C. Kainen, Vera KurkovÃ¡. neco, 21(10):2970-2989, 2009. [doi]

Complexity of Gaussian-radial-basis networks approximating smooth functionsPaul C. Kainen, Vera Kurková, Marcello Sanguineti. jc, 25(1):63-74, 2009. [doi]

On Tractability of Neural-Network ApproximationPaul C. Kainen, Vera KurkovÃ¡, Marcello Sanguineti. icannga 2009: 11-21 [doi]

2008

Estimates of Network Complexity and Integral RepresentationsPaul C. Kainen, Vera Kurková. icann 2008: 31-40 [doi]

2007

Extension of a theorem of WhitneyPaul C. Kainen, Shannon Overbay. appml, 20(7):835-837, 2007. [doi]

A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane wavesPaul C. Kainen, Vera Kurková, Andrew Vogt. jat, 147(1):1-10, 2007. [doi]

Estimates of Approximation Rates by Gaussian Radial-Basis FunctionsPaul C. Kainen, Vera Kurková, Marcello Sanguineti. icannga 2007: 11-18 [doi]

2005

Rates of Minimization of Error Functionals over Boolean Variable-Basis FunctionsPaul C. Kainen, Vera Kurková, Marcello Sanguineti. jmma, 4(4):355-368, 2005. [doi]

2004

Replacing points by compacta in neural network approximationPaul C. Kainen. jfi, 341(4):391-399, 2004. [doi]

Minimization of Error Functionals over Variable-Basis FunctionsPaul C. Kainen, Vera Kurková, Marcello Sanguineti. siamjo, 14(3):732-742, 2004. [doi]

2003

Best approximation by linear combinations of characteristic functions of half-spacesPaul C. Kainen, Vera Kurková, Andrew Vogt. jat, 122(2):151-159, 2003. [doi]

2002

On robust cycle basesPaul C. Kainen. endm, 11:430-437, 2002. [doi]

2001

Continuity of Approximation by Neural Networks in Lp SpacesPaul C. Kainen, Vera Kurková, Andrew Vogt. anor, 101(1-4):143-147, 2001. [doi]

2000

Convex Geometry and Nonlinear ApproximationPaul C. Kainen. ijcnn 2000: 299-304 [doi]

Best approximation by Heaviside perceptron networksPaul C. Kainen, Vera Kurková, Andrew Vogt. NN, 13(7):695-697, 2000. [doi]

1999

Approximation by neural networks is not continuousPaul C. Kainen, Vera Kurková, Andrew Vogt. ijon, 29(1-3):47-56, 1999. [doi]

1997

Estimates of the Number of Hidden Units and Variation with Respect to Half-SpacesVera Kurková, Paul C. Kainen, Vladik Kreinovich. NN, 10(6):1061-1068, 1997. [doi]

1996

A geometric method to obtain error-correcting classification by neural networks with fewer hidden unitsVera Kurková, Paul C. Kainen. icnn 1996: 1227-1232 [doi]

1994

Uniqueness of network parametrization and faster learningPaul C. Kainen, Vera Kurková, Vladik Kreinovich, Ongard Sirisaengtaksin. npsc, 2(4):459-466, 1994. [doi]

Functionally Equivalent Feedforward Neural NetworksVera KurkovÃ¡, Paul C. Kainen. neco, 6(3):543-558, 1994. [doi]

1979

The book thickness of a graphFrank Bernhart, Paul C. Kainen. JCT, 27(3):320-331, 1979. [doi]

1978

On finite superuniversal graphsPaul Erdös, Stephen H. Hechler, Paul C. Kainen. DM, 24(3):235-249, 1978. [doi]

On stable crossing numbersPaul C. Kainen, Arthur T. White. jgt, 2(3):181-187, 1978. [doi]

Sign in or sign up to see more results.

runs on WebDSL