default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul C. Kainen
Person information
- affiliation: Georgetown University, Washington, DC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Richard H. Hammack, Paul C. Kainen:
Euler's Theorem for Regular CW-Complexes. Comb. 44(3): 453-465 (2024)- [j28]Paul C. Kainen, Samuel Joslin, Shannon Overbay:
On Dispersability of Some Circulant Graphs. J. Graph Algorithms Appl. 28(1): 225-241 (2024) - 2023
- [i4]Paul C. Kainen:
Construction numbers: How to build a graph? CoRR abs/2302.13186 (2023) - [i3]Paul C. Kainen, Andrew Vogt:
Bochner integrals and neural networks. CoRR abs/2302.13228 (2023) - [i2]Paul C. Kainen:
Canonical Sphere Bases for Simplicial and Cubical Complexes. CoRR abs/2303.07947 (2023) - 2021
- [j27]Richard H. Hammack, Paul C. Kainen:
A New View of Hypercube Genus. Am. Math. Mon. 128(4): 352-359 (2021) - [i1]Paul C. Kainen:
Lunaport: Math, Mechanics & Transport. CoRR abs/2107.14423 (2021) - 2020
- [j26]Richard H. Hammack, Paul C. Kainen:
Sphere decompositions of hypercubes. Art Discret. Appl. Math. 3(2) (2020) - [j25]Paul C. Kainen:
On 2-skeleta of hypercubes. Art Discret. Appl. Math. 3(2) (2020) - [j24]Paul C. Kainen, Vera Kurková
, Andrew Vogt:
Approximative compactness of linear combinations of characteristic functions. J. Approx. Theory 257: 105435 (2020)
2010 – 2019
- 2018
- [j23]Richard H. Hammack, Paul C. Kainen:
Robust cycle bases do not exist for if. Discret. Appl. Math. 235: 206-211 (2018) - [j22]Richard H. Hammack, Paul C. Kainen:
Graph Bases and Diagram Commutativity. Graphs Comb. 34(4): 523-534 (2018) - 2015
- [j21]Paul C. Kainen:
Cycle construction and geodesic cycles with application to the hypercube. Ars Math. Contemp. 9(1): 27-43 (2015) - 2014
- [j20]Vera Kurková, Paul C. Kainen:
Comparing fixed and variable-width Gaussian networks. Neural Networks 57: 23-28 (2014) - 2013
- [p2]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Approximating Multivariable Functions by Feedforward Neural Nets. Handbook on Neural Information Processing 2013: 143-181 - [p1]Paul C. Kainen, Andrew Vogt:
Bochner Integrals and Neural Networks. Handbook on Neural Information Processing 2013: 183-214 - 2012
- [j19]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks. IEEE Trans. Inf. Theory 58(2): 1203-1214 (2012) - 2011
- [c6]Vera Kurková, Paul C. Kainen:
Kernel Networks with Fixed and Variable Widths. ICANNGA (1) 2011: 12-21
2000 – 2009
- 2009
- [j18]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Complexity of Gaussian-radial-basis networks approximating smooth functions. J. Complex. 25(1): 63-74 (2009) - [j17]Paul C. Kainen, Vera Kurková:
An Integral Upper Bound for Neural Network Approximation. Neural Comput. 21(10): 2970-2989 (2009) - [c5]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
On Tractability of Neural-Network Approximation. ICANNGA 2009: 11-21 - 2008
- [c4]Paul C. Kainen, Vera Kurková:
Estimates of Network Complexity and Integral Representations. ICANN (1) 2008: 31-40 - 2007
- [j16]Paul C. Kainen, Shannon Overbay:
Extension of a theorem of Whitney. Appl. Math. Lett. 20(7): 835-837 (2007) - [j15]Paul C. Kainen, Vera Kurková, Andrew Vogt:
A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves. J. Approx. Theory 147(1): 1-10 (2007) - [c3]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Estimates of Approximation Rates by Gaussian Radial-Basis Functions. ICANNGA (2) 2007: 11-18 - 2005
- [j14]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Rates of Minimization of Error Functionals over Boolean Variable-Basis Functions. J. Math. Model. Algorithms 4(4): 355-368 (2005) - 2004
- [j13]Paul C. Kainen:
Replacing points by compacta in neural network approximation. J. Frankl. Inst. 341(4): 391-399 (2004) - [j12]Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
Minimization of Error Functionals over Variable-Basis Functions. SIAM J. Optim. 14(3): 732-742 (2004) - 2003
- [j11]Paul C. Kainen, Vera Kurková, Andrew Vogt:
Best approximation by linear combinations of characteristic functions of half-spaces. J. Approx. Theory 122(2): 151-159 (2003) - 2002
- [j10]Paul C. Kainen:
On robust cycle bases. Electron. Notes Discret. Math. 11: 430-437 (2002) - 2001
- [j9]Paul C. Kainen, Vera Kurková, Andrew Vogt:
Continuity of Approximation by Neural Networks in Lp Spaces. Ann. Oper. Res. 101(1-4): 143-147 (2001) - 2000
- [j8]Paul C. Kainen, Vera Kurková, Andrew Vogt:
Best approximation by Heaviside perceptron networks. Neural Networks 13(7): 695-697 (2000) - [c2]Paul C. Kainen:
Convex Geometry and Nonlinear Approximation. IJCNN (1) 2000: 299-304
1990 – 1999
- 1999
- [j7]Paul C. Kainen, Vera Kurková, Andrew Vogt:
Approximation by neural networks is not continuous. Neurocomputing 29(1-3): 47-56 (1999) - 1997
- [j6]Vera Kurková, Paul C. Kainen, Vladik Kreinovich:
Estimates of the Number of Hidden Units and Variation with Respect to Half-Spaces. Neural Networks 10(6): 1061-1068 (1997) - 1996
- [c1]Vera Kurková, Paul C. Kainen:
A geometric method to obtain error-correcting classification by neural networks with fewer hidden units. ICNN 1996: 1227-1232 - 1994
- [j5]Vera Kurková, Paul C. Kainen:
Functionally Equivalent Feedforward Neural Networks. Neural Comput. 6(3): 543-558 (1994) - [j4]Paul C. Kainen, Vera Kurková, Vladik Kreinovich, Ongard Sirisaengtaksin:
Uniqueness of network parametrization and faster learning. Neural Parallel Sci. Comput. 2(4): 459-466 (1994)
1970 – 1979
- 1979
- [j3]Frank Bernhart, Paul C. Kainen:
The book thickness of a graph. J. Comb. Theory B 27(3): 320-331 (1979) - 1978
- [j2]Paul Erdös, Stephen H. Hechler, Paul C. Kainen:
On finite superuniversal graphs. Discret. Math. 24(3): 235-249 (1978) - [j1]Paul C. Kainen, Arthur T. White:
On stable crossing numbers. J. Graph Theory 2(3): 181-187 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-27 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
