Follow
Paul Kainen
Paul Kainen
Adj Prof at Gtn Univ & Dir. of the Lab for Visual Math, Department of Mathematics and Statistics
Verified email at georgetown.edu - Homepage
Title
Cited by
Cited by
Year
The book thickness of a graph
F Bernhart, PC Kainen
Journal of Combinatorial Theory, Series B 27 (3), 320-331, 1979
4991979
The four-color problem: assaults and conquest
TL Saaty, PC Kainen
McGraw-Hill, 1977
3581977
Estimates of the number of hidden units and variation with respect to half-spaces
V Kůrková, PC Kainen, V Kreinovich
Neural Networks 10 (6), 1061-1068, 1997
1211997
Toroidal graphs with arbitrarily high crossing numbers
F Harary, PC Kainen, AJ Schwenk
Nanta Math 6 (1), 58-67, 1973
1171973
Functionally equivalent feedforward neural networks
V Kůrková, PC Kainen
Neural Computation 6 (3), 543-558, 1994
941994
Approximation by neural networks is not continuous
PC Kainen, V Kůrková, A Vogt
Neurocomputing 29 (1-3), 47-56, 1999
641999
Quasiorthogonal dimension of Euclidean spaces
PC Kainen, V Kůrková
Applied mathematics letters 6 (3), 7-10, 1993
641993
The book thickness of a graph II
PC Kainen
Congressus Numerantium 71, 121-132, 1990
611990
Complexity of Gaussian-radial-basis networks approximating smooth functions
PC Kainen, V Kůrková, M Sanguineti
Journal of Complexity 25 (1), 63-74, 2009
592009
Thickness and coarseness of graphs
PC Kainen
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 39 (1 …, 1973
571973
Some recent results in topological graph theory
PC Kainen
Graphs and Combinatorics: Proceedings of the Capital Conference on Graph …, 2006
552006
Dependence of computational models on input dimension: Tractability of approximation and optimization tasks
PC Kainen, V Kurkova, M Sanguineti
IEEE Transactions on Information Theory 58 (2), 1203-1214, 2012
542012
A lower bound for crossing numbers of graphs with applications to Kn, Kp, q, and Q (d)
PC Kainen
Journal of Combinatorial Theory, Series B 12 (3), 287-298, 1972
541972
Utilizing geometric anomalies of high dimension: When complexity makes computation easier
PC Kainen
Computer Intensive Methods in Control and Signal Processing: The Curse of …, 1997
521997
An integral upper bound for neural network approximation
PC Kainen, V Kůrková
Neural Computation 21 (10), 2970-2989, 2009
462009
Geometry and topology of continuous best and near best approximations
PC Kainen, V Kůrková, A Vogt
Journal of Approximation Theory 105 (2), 252-262, 2000
392000
A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
PC Kainen, V Kůrková, A Vogt
Journal of Approximation Theory 147 (1), 1-10, 2007
332007
Minimization of error functionals over variable-basis functions
PC Kainen, V Kurková, M Sanguineti
SIAM Journal on Optimization 14 (3), 732-742, 2004
322004
Weak adjoint functors
PC Kainen
Mathematische Zeitschrift 122, 1-9, 1971
311971
Best approximation by Heaviside perceptron networks
P Kainen, V Kůrková, A Vogt
Neural Networks 13 (7), 695-697, 2000
302000
The system can't perform the operation now. Try again later.
Articles 1–20