Paul C. Kainen

44 papers Journal 36Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	All bipartite circulants are dispersable. Art Discret. Appl. Math. Shannon Overbay, Samuel S. Joslin, Paul C. Kainen
2024	J	`jnl`	Complexity of graph evolutions. CoRR Jeffrey Gao, Paul C. Kainen
2024	J	`jnl`	Euler's Theorem for Regular CW-Complexes. Comb. Richard H. Hammack, Paul C. Kainen
2024	J	`jnl`	On Dispersability of Some Circulant Graphs. J. Graph Algorithms Appl. Paul C. Kainen, Samuel Joslin, Shannon Overbay
2024	J	`jnl`	Star arboricity relaxed book thickness of K CoRR Paul C. Kainen
2023	J	`jnl`	Bochner integrals and neural networks. CoRR Paul C. Kainen, Andrew Vogt
2023	J	`jnl`	Canonical Sphere Bases for Simplicial and Cubical Complexes. CoRR Paul C. Kainen
2023	J	`jnl`	Construction numbers: How to build a graph? CoRR Paul C. Kainen
2021	J	`jnl`	A New View of Hypercube Genus. Am. Math. Mon. Richard H. Hammack, Paul C. Kainen
2021	J	`jnl`	Lunaport: Math, Mechanics & Transport. CoRR Paul C. Kainen
2020	J	`jnl`	Approximative compactness of linear combinations of characteristic functions. J. Approx. Theory Paul C. Kainen, Vera Kurková, Andrew Vogt
2020	J	`jnl`	On 2-skeleta of hypercubes. Art Discret. Appl. Math. Paul C. Kainen
2020	J	`jnl`	Sphere decompositions of hypercubes. Art Discret. Appl. Math. Richard H. Hammack, Paul C. Kainen
2018	J	`jnl`	Graph Bases and Diagram Commutativity. Graphs Comb. Richard H. Hammack, Paul C. Kainen
2018	J	`jnl`	Robust cycle bases do not exist for if. Discret. Appl. Math. Richard H. Hammack, Paul C. Kainen
2015	J	`jnl`	Cycle construction and geodesic cycles with application to the hypercube. Ars Math. Contemp. Paul C. Kainen
2014	J	`jnl`	Comparing fixed and variable-width Gaussian networks. Neural Networks Vera Kurková, Paul C. Kainen
2013	—	`ch.`	Approximating Multivariable Functions by Feedforward Neural Nets. Handbook on Neural Information Processing Paul C. Kainen, Vera Kurková, Marcello Sanguineti
2013	—	`ch.`	Bochner Integrals and Neural Networks. Handbook on Neural Information Processing Paul C. Kainen, Andrew Vogt
2012	J	`jnl`	Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks. IEEE Trans. Inf. Theory Paul C. Kainen, Vera Kurková, Marcello Sanguineti
2011	—	`conf`	Kernel Networks with Fixed and Variable Widths. ICANNGA (1) Vera Kurková, Paul C. Kainen
2009	J	`jnl`	An Integral Upper Bound for Neural Network Approximation. Neural Comput. Paul C. Kainen, Vera Kurková
2009	J	`jnl`	Complexity of Gaussian-radial-basis networks approximating smooth functions. J. Complex. Paul C. Kainen, Vera Kurková, Marcello Sanguineti
2009	—	`conf`	On Tractability of Neural-Network Approximation. ICANNGA Paul C. Kainen, Vera Kurková, Marcello Sanguineti
2008	—	`conf`	Estimates of Network Complexity and Integral Representations. ICANN (1) Paul C. Kainen, Vera Kurková
2007	J	`jnl`	A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves. J. Approx. Theory Paul C. Kainen, Vera Kurková, Andrew Vogt
2007	—	`conf`	Estimates of Approximation Rates by Gaussian Radial-Basis Functions. ICANNGA (2) Paul C. Kainen, Vera Kurková, Marcello Sanguineti
2007	J	`jnl`	Extension of a theorem of Whitney. Appl. Math. Lett. Paul C. Kainen, Shannon Overbay
2005	J	`jnl`	Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions. J. Math. Model. Algorithms Paul C. Kainen, Vera Kurková, Marcello Sanguineti
2004	J	`jnl`	Minimization of Error Functionals over Variable-Basis Functions. SIAM J. Optim. Paul C. Kainen, Vera Kurková, Marcello Sanguineti
2004	J	`jnl`	Replacing points by compacta in neural network approximation. J. Frankl. Inst. Paul C. Kainen
2003	J	`jnl`	Best approximation by linear combinations of characteristic functions of half-spaces. J. Approx. Theory Paul C. Kainen, Vera Kurková, Andrew Vogt
2002	J	`jnl`	On robust cycle bases. Electron. Notes Discret. Math. Paul C. Kainen
2001	J	`jnl`	Continuity of Approximation by Neural Networks in Lp Spaces. Ann. Oper. Res. Paul C. Kainen, Vera Kurková, Andrew Vogt
2000	J	`jnl`	Best approximation by Heaviside perceptron networks. Neural Networks Paul C. Kainen, Vera Kurková, Andrew Vogt
2000	—	`conf`	Convex Geometry and Nonlinear Approximation. IJCNN (1) Paul C. Kainen
1999	J	`jnl`	Approximation by neural networks is not continuous. Neurocomputing Paul C. Kainen, Vera Kurková, Andrew Vogt
1997	J	`jnl`	Estimates of the Number of Hidden Units and Variation with Respect to Half-Spaces. Neural Networks Vera Kurková, Paul C. Kainen, Vladik Kreinovich
1996	—	`conf`	A geometric method to obtain error-correcting classification by neural networks with fewer hidden units. ICNN Vera Kurková, Paul C. Kainen
1994	J	`jnl`	Functionally Equivalent Feedforward Neural Networks. Neural Comput. Vera Kurková, Paul C. Kainen
1994	J	`jnl`	Uniqueness of network parametrization and faster learning. Neural Parallel Sci. Comput. Paul C. Kainen, Vera Kurková, Vladik Kreinovich, Ongard Sirisaengtaksin
1979	J	`jnl`	The book thickness of a graph. J. Comb. Theory B Frank Bernhart, Paul C. Kainen
1978	J	`jnl`	On finite superuniversal graphs. Discret. Math. Paul Erdös, Stephen H. Hechler, Paul C. Kainen
1978	J	`jnl`	On stable crossing numbers. J. Graph Theory Paul C. Kainen, Arthur T. White