Segui
Paul Kainen
Paul Kainen
Adjunct Professor and Director of the Lab for Visual Math, Department of Mathematics and Statistics
Email verificata su georgetown.edu - Home page
Titolo
Citata da
Citata da
Anno
The book thickness of a graph
F Bernhart, PC Kainen
Journal of Combinatorial Theory, Series B 27 (3), 320-331, 1979
4671979
The four-color problem: assaults and conquest
TL Saaty, PC Kainen
McGraw-Hill International Book Company, 1977
3521977
Toroidal graphs with arbitrarily high crossing numbers
F Harary, PC Kainen, AJ Schwenk
Nanta Math 6 (1), 58-67, 1973
1141973
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
1121997
Functionally equivalent feedforward neural networks
V KůrkovŠ, PC Kainen
Neural Computation 6 (3), 543-558, 1994
821994
Quasiorthogonal dimension of Euclidean spaces
PC Kainen, V KůrkovŠ
Applied mathematics letters 6 (3), 7-10, 1993
611993
The book thickness of a graph II
PC Kainen
Congressus Numerantium 71, 121-132, 1990
611990
Approximation by neural networks is not continuous
PC Kainen, V KůrkovŠ, A Vogt
Neurocomputing 29 (1-3), 47-56, 1999
591999
Complexity of Gaussian-radial-basis networks approximating smooth functions
PC Kainen, V KůrkovŠ, M Sanguineti
Journal of Complexity 25 (1), 63-74, 2009
582009
Thickness and coarseness of graphs
PC Kainen
Abhandlungen aus dem Mathematischen Seminar der Universitšt Hamburg 39 (1†…, 1973
571973
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
531972
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
502012
Some recent results in topological graph theory
PC Kainen
Graphs and Combinatorics, 76-108, 1974
481974
Utilizing geometric anomalies of high dimension: When complexity makes computation easier
PC Kainen
Computer intensive methods in control and signal processing, 283-294, 1997
461997
An integral upper bound for neural network approximation
PC Kainen, V KůrkovŠ
Neural Computation 21 (10), 2970-2989, 2009
442009
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
372000
Minimization of error functionals over variable-basis functions
PC Kainen, V KurkovŠ, M Sanguineti
SIAM Journal on Optimization 14 (3), 732-742, 2004
322004
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
312007
On stable crossing numbers
PC Kainen, AT White
Journal of Graph Theory 2 (3), 181-187, 1978
301978
The four-color problem: assaults and conquest
PC Kainen, TL Saaty
McGraw-Hill, 1977
281977
Il sistema al momento non puÚ eseguire l'operazione. Riprova piý tardi.
Articoli 1–20