| 2007 |
|---|
| 12 | EE | Mark A. Kon,
Dustin T. Holloway,
Yue Fan,
Chaitanya Sai,
Charles DeLisi:
Learning Methods for DNA Binding in Computational Biology.
IJCNN 2007: 2358-2365 |
| 2006 |
|---|
| 11 | EE | Dustin T. Holloway,
Mark A. Kon,
Charles DeLisi:
Machine learning methods for transcription data integration.
IBM Journal of Research and Development 50(6): 631-644 (2006) |
| 2005 |
|---|
| 10 | | Mark A. Kon,
Leszek Plaskota,
Andrzej W. Przybyszewski:
Statistical Likelihood Representations of Prior Knowledge in Machine Learning.
Artificial Intelligence and Applications 2005: 467-472 |
| 9 | | Mark A. Kon,
Leszek Plaskota,
Andrzej W. Przybyszewski:
Machine Learning and Statistical MAP Methods.
Intelligent Information Systems 2005: 441-445 |
| 8 | EE | Mark A. Kon,
Leszek Plaskota:
Information-based nonlinear approximation: an average case setting.
J. Complexity 21(2): 211-229 (2005) |
| 2001 |
|---|
| 7 | EE | Mark A. Kon,
Leszek Plaskota:
Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach.
J. Complexity 17(2): 345-365 (2001) |
| 2000 |
|---|
| 6 | EE | Mark A. Kon,
Leszek Plaskota:
Information complexity of neural networks.
Neural Networks 13(3): 365-375 (2000) |
| 1994 |
|---|
| 5 | EE | Mark A. Kon:
On the delta->0 Limit in Probabilistic Complexity.
J. Complexity 10(3): 356-365 (1994) |
| 1991 |
|---|
| 4 | EE | Mark A. Kon,
Roberto Tempo:
Linearity of algorithms and a result of Ando.
J. Complexity 7(2): 213-217 (1991) |
| 3 | EE | Mark A. Kon,
Klaus Ritter,
Arthur G. Werschulz:
On the average case solvability of III-posed problems.
J. Complexity 7(3): 220-224 (1991) |
| 1989 |
|---|
| 2 | EE | Mark A. Kon,
Roberto Tempo:
On linearity of spline algorithms.
J. Complexity 5(2): 251-259 (1989) |
| 1 | EE | Mark A. Kon,
Erich Novak:
On the adaptive and continuous information problems.
J. Complexity 5(3): 345-362 (1989) |
