Paul C. Kainen

Affiliations:
  • Georgetown University, Washington, DC, USA


According to our database1, Paul C. Kainen authored at least 39 papers between 1978 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Canonical Sphere Bases for Simplicial and Cubical Complexes.
CoRR, 2023

Bochner integrals and neural networks.
CoRR, 2023

Construction numbers: How to build a graph?
CoRR, 2023

2021
A New View of Hypercube Genus.
Am. Math. Mon., 2021

Lunaport: Math, Mechanics & Transport.
CoRR, 2021

2020
Approximative compactness of linear combinations of characteristic functions.
J. Approx. Theory, 2020

On 2-skeleta of hypercubes.
Art Discret. Appl. Math., 2020

Sphere decompositions of hypercubes.
Art Discret. Appl. Math., 2020

2018
Graph Bases and Diagram Commutativity.
Graphs Comb., 2018

Robust cycle bases do not exist for if.
Discret. Appl. Math., 2018

2015
Cycle construction and geodesic cycles with application to the hypercube.
Ars Math. Contemp., 2015

2014
Comparing fixed and variable-width Gaussian networks.
Neural Networks, 2014

2013
Bochner Integrals and Neural Networks.
Proceedings of the Handbook on Neural Information Processing, 2013

Approximating Multivariable Functions by Feedforward Neural Nets.
Proceedings of the Handbook on Neural Information Processing, 2013

2012
Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks.
IEEE Trans. Inf. Theory, 2012

2011
Kernel Networks with Fixed and Variable Widths.
Proceedings of the Adaptive and Natural Computing Algorithms, 2011

2009
An Integral Upper Bound for Neural Network Approximation.
Neural Comput., 2009

Complexity of Gaussian-radial-basis networks approximating smooth functions.
J. Complex., 2009

On Tractability of Neural-Network Approximation.
Proceedings of the Adaptive and Natural Computing Algorithms, 9th International Conference, 2009

2008
Estimates of Network Complexity and Integral Representations.
Proceedings of the Artificial Neural Networks, 2008

2007
A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves.
J. Approx. Theory, 2007

Extension of a theorem of Whitney.
Appl. Math. Lett., 2007

Estimates of Approximation Rates by Gaussian Radial-Basis Functions.
Proceedings of the Adaptive and Natural Computing Algorithms, 8th International Conference, 2007

2005
Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions.
J. Math. Model. Algorithms, 2005

2004
Minimization of Error Functionals over Variable-Basis Functions.
SIAM J. Optim., 2004

Replacing points by compacta in neural network approximation.
J. Frankl. Inst., 2004

2003
Best approximation by linear combinations of characteristic functions of half-spaces.
J. Approx. Theory, 2003

2002
On robust cycle bases.
Electron. Notes Discret. Math., 2002

2001
Continuity of Approximation by Neural Networks in Lp Spaces.
Ann. Oper. Res., 2001

2000
Best approximation by Heaviside perceptron networks.
Neural Networks, 2000

Convex Geometry and Nonlinear Approximation.
Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks, 2000

1999
Approximation by neural networks is not continuous.
Neurocomputing, 1999

1997
Estimates of the Number of Hidden Units and Variation with Respect to Half-Spaces.
Neural Networks, 1997

1996
A geometric method to obtain error-correcting classification by neural networks with fewer hidden units.
Proceedings of International Conference on Neural Networks (ICNN'96), 1996

1994
Uniqueness of network parametrization and faster learning.
Neural Parallel Sci. Comput., 1994

Functionally Equivalent Feedforward Neural Networks.
Neural Comput., 1994

1979
The book thickness of a graph.
J. Comb. Theory, Ser. B, 1979

1978
On stable crossing numbers.
J. Graph Theory, 1978

On finite superuniversal graphs.
Discret. Math., 1978


  Loading...