MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Pekka Orponen – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

52 documents found, showing 1 through 10. Next 10 →

ATOM

The Computational Power of Discrete Hopfield Nets with Hidden Units
by Pekka Orponen — 1996 — Neural Computation
…The Computational Power of Discrete Hopfield Nets with Hidden Units Pekka Orponen Department…
Cited by 9 (6 self) – Add To MetaCart

On the Computational Power of Discrete Hopfield Nets
by Pekka Orponen — 1993 — In: Proc. 20th International Colloquium on Automata, Languages, and Programming
…On the Computational Power of Discrete Hopfield Nets ? Pekka Orponen Department of Computer…
Cited by 6 (4 self) – Add To MetaCart

Neural Networks and Complexity Theory
by Pekka Orponen — 1992 — In Proc. 17th International Symposium on Mathematical Foundations of Computer Science
…Neural Networks and Complexity Theory Pekka Orponen Department of Computer Science, University…
Cited by 12 (4 self) – Add To MetaCart

Dempster's Rule of Combination is P-complete
by Pekka Orponen — 1990 — Artificial Intelligence
…Dempster's Rule of Combination is #P-complete Pekka Orponen Department of Computer Science…
Cited by 18 (0 self) – Add To MetaCart

An Overview Of The Computational Power Of Recurrent Neural Networks
by Pekka Orponen — 2000 — Proceedings of the 9th Finnish AI Conference STeP 2000{Millennium of AI, Espoo, Finland (Vol. 3: "AI of Tomorrow": Symposium on Theory, Finnish AI Society
…AN OVERVIEW OF THE COMPUTATIONAL POWER OF RECURRENT NEURAL NETWORKS Pekka Orponen University…
Cited by 10 (3 self) – Add To MetaCart

Computational Complexity Of Neural Networks: A Survey
by Pekka Orponen — 1994
… PEKKA ORPONEN Department of Computer Science P. O. Box 26 FIN-00014 University of Helsinki, Finland E…
Cited by 18 (6 self) – Add To MetaCart

The Computational Power of Continuous Time Neural Networks
by Pekka Orponen — 1995 — In Proc. SOFSEM'97, the 24th Seminar on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science
…The Computational Power of Continuous Time Neural Networks (Preliminary Version) Pekka Orponen…
Cited by 14 (8 self) – Add To MetaCart

Computing with Truly Asynchronous Threshold Logic Networks
by Pekka Orponen — 1995 — Theoretical Computer Science
…Computing with Truly Asynchronous Threshold Logic Networks Pekka Orponen Institute for Theoretical…
Cited by 16 (7 self) – Add To MetaCart

A Survey of Continuous-Time Computation Theory
by Pekka Orponen — 1997 — Advances in Algorithms, Languages, and Complexity
…A Survey of Continuous-Time Computation Theory Pekka Orponen Department of Mathematics University…
Cited by 23 (7 self) – Add To MetaCart

Random Strings Make Hard Instances
by Harry Buhrman Pekka, Pekka Orponen — 1994 — In Proc. 9th Structure in Complexity Theory Conference
…Random Strings Make Hard Instances Harry Buhrman Pekka Orponen Dept. Llenguatges i Sist. Inform…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB