133 | Alexandre Iline, Harri Valpola, and Erkki Oja. Detecting process state changes by nonlinear blind source separation. In Proceedings of the 3rd International Conference on Independent Component Analysis and Signal Separation (ICA 2001), pages 704–709, San Diego, California, December 2001. |
|
132 | Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Research Report A70, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2001. |
|
131 | Cédric Archambeau, Amaury Lendasse, Charles Trullemans, Claude Veraart, Jean Delbeke, and Michel Verleysen. Phosphene evaluation in a visual prosthesis with artificial neural networks. In Adaptive Systems and Hybrid Computational Intelligence in Medicine, special session proceedings of EUNITE 2001, Tenerife (Spain), pages 116–122, December 13-14 2001. |
|
130 | Cédric Archambeau, Amaury Lendasse, Charles Trullemans, Claude Veraart, Jean Delbeke, and Michel Verleysen. Phosphene evaluation in a visual prosthesis with artificial neural networks. In EUNITE 2001, European Symposium on Intelligent Technologies, Hybrid Systems and their implementation on Smart Adaptive Systems, Tenerife (Spain), pages 509–515, December 13-14 2001. |
|
129 | Marko Mäkelä, Timo Latvala, and Kimmo Varpaaniemi. Maria 1.0—modular reachability analyser. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, November 2001. Software. |
|
128 | Marko Mäkelä. Rinnakkaisuus hallintaan—formaalit menetelmät mutkikkaiden järjestelmien suunnittelun apuna. Prosessori, pages 68–71, November 2001. Erikoisnumero: elektroniikan suunnittelu (ES). |
|
127 | Olli Simula, Jaakko Hollmén, and Esa Alhoniemi. Models from data: analysis of industrial processes and telecommunication systems. In Proceedings of the National Conference on Industrial Automation, Ancona, Italy, pages 13–19, November 2001. |
|
126 | Kimmo Raivio, Olli Simula, and Jaana Laiho. Neural analysis of mobile radio access network. In IEEE International Conference on Data Mining, pages 457–464, San Jose, California, USA, November 29 - December 2 2001. |
|
125 | Amaury Lendasse, John A. Lee, Eric de Bodt, Vincent Wertz, and Michel Verleysen. Approximation using radial basis functions networks - application to pricing derivative securities. In ACSEG 2001, Connectionist Approaches in Economics and Management Sciences, Rennes (France), pages 275–283, November 22-23 2001. |
|
124 | Marko Mäkelä, Timo Latvala, and Kimmo Varpaaniemi. Maria 1.0—modular reachability analyser. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, November 2001. Software. |
|
123 | Marko Mäkelä. Rinnakkaisuus hallintaan—formaalit menetelmät mutkikkaiden järjestelmien suunnittelun apuna. Prosessori, pages 68–71, November 2001. Erikoisnumero: elektroniikan suunnittelu (ES). |
|
122 | Marko Mäkelä and Kimmo Varpaaniemi. lsts2pn — a translator from TVT LSTS files to the input file language of MaRiA. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, September 2001. Software. |
|
121 | Markus Koskela, Jorma Laaksonen, and Erkki Oja. Self-organizing image retrieval with MPEG-7 descriptors. In Proceedings of Infotech Oulu International Workshop on Information Retrieval, pages 151–160, Oulu, Finland, September 2001. |
|
120 | Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. In Thomas Eiter, Wolfgang Faber, and Mirosaw Truszczynski, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'2001), volume 2173 of Lecture Notes in Artificial Intelligence, pages 200–212, Vienna, Austria, September 2001. Springer-Verlag. |
|
119 | Marko Mäkelä and Kimmo Varpaaniemi. lsts2pn — a translator from TVT LSTS files to the input file language of MaRiA. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, September 2001. Software. |
|
118 | Tommi Syrjänen. Omega-restricted logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 267–279, Vienna, Austria, September 2001. Springer-Verlag. |
|
117 | Tommi Syrjänen and Ilkka Niemelä. The smodels system. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria, September 2001. Springer-Verlag. |
|
116 | Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Thomas Eiter, Wolfgang Faber, and Mirek Truszczyński, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 6th International Conference, pages 93–106, Vienna, Austria, September 2001. Springer-Verlag. LNAI 2173. |
|
115 | Keijo Heljanko. Bounded reachability checking with process semantics. In Kim Guldstrand Larsen and Mogens Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001), volume 2154 of Lecture Notes in Computer Science, pages 218–232, Aalborg, Denmark, August 2001. Springer-Verlag. |
|
114 | Krista Lagus, Esa Alhoniemi, and Harri Valpola. Independent variable group analysis. In Georg Dorffner, Horst Bischof, and Kurt Hornik, editors, International Conference on Artificial Neural Networks - ICANN 2001, volume 2130 of LLNCS, pages 203–210, Vienna, Austria, August 2001. Springer. |
|
113 | Tommi Syrjänen. Version spaces and rule-based configuration management. In Working Notes of the IJCAI 2001 Workshop on Configuration, August 2001. |
|
112 | Kimmo Varpaaniemi, editor. Annual report for the year 2000. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, July 2001. |
|
111 | Marko Mäkelä. A reachability analyser for algebraic system nets. Research Report A69, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2001. |
|
110 | Eero Lassila. A tree expansion formalism for generative string rewriting. Technical Report B20, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2001. |
|
109 | Marko Mäkelä. Optimising enabling tests and unfoldings of algebraic system nets. In José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001: 22nd International Conference, ICATPN 2001, number 2075 in Lecture Notes in Computer Science, pages 283–302, Newcastle upon Tyne, UK, June 2001. Springer-Verlag, Berlin, Germany. |
|
108 | Robert Denda, Ana V. Medina, Federico Montesino-Pouzols, and Antonio Marin. MUVITRAN: A solution for the transmission of high-quality real-time video over the HFC return channel. In IEEE International Conference on Telecommunications, pages 343–348, Bucharest, Romania, June 2001. |
|
107 | Jorma Laaksonen, Markus Koskela, Sami Laakso, and Erkki Oja. Self-organizing maps as a relevance feedback technique in content-based image retrieval. Pattern Analysis & Applications, 4(2+3):140–152, June 2001. |
|
106 | Sami Laakso, Jorma Laaksonen, Markus Koskela, and Erkki Oja. Self-organizing maps of web link information. In Nigel Allinson, Hujun Yin, Lesley Allinson, and Jon Slack, editors, Advances in Self-Organising Maps, pages 146–151, Lincoln, England, June 2001. Springer. |
|
105 | Markus Koskela, Jorma Laaksonen, and Erkki Oja. Comparison of techniques for content-based image retrieval. In Proceedings of 12th Scandinavian Conference on Image Analysis (SCIA 2001), pages 579–586, Bergen, Norway, June 2001. |
|
104 | Keijo Heljanko, Victor Khomenko, and Maciej Koutny. Parallelisation of the Petri net unfolding algorithm. Technical Report CS-TR-733, Department of Computer Science, University of Newcastle upon Tyne, Newcastle, United Kindom, June 2001. |
|
103 | Krista Lagus. Studying similarities in term usage with self-organizing maps. In Proceedings of NordTerm'01, pages 34–45, Helsinki, Finland, June 13.-16. 2001. |
|
102 | Marko Mäkelä. Optimising enabling tests and unfoldings of algebraic system nets. In José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001: 22nd International Conference, ICATPN 2001, number 2075 in Lecture Notes in Computer Science, pages 283–302, Newcastle upon Tyne, UK, June 2001. Springer-Verlag, Berlin, Germany. |
|
101 | Stefan Brass, Jürgen Dix, Ilkka Niemelä, and T.C. Przymusinski. On the equivalence of the static and disjunctive well-founded semantics and its computation. Theoretical Computer Science, 258(1–2):523–553, May 2001. |
|
100 | Markus Koskela, Jorma Laaksonen, and Erkki Oja. PicSOM content-based image retrieval system - comparison of techniques. In Proceedings of 3rd European Workshop on Image Analysis for Multimedia Interactive Services, pages 89–94, Tampere, Finland, May 2001. |
|
99 | Javier Esparza and Keijo Heljanko. Implementing LTL model checking with net unfoldings. In Matthew B. Dwyer, editor, Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'2001), volume 2057 of Lecture Notes in Computer Science, pages 37–56, Toronto, Canada, May 2001. Springer-Verlag. |
|
98 | Amaury Lendasse, John A. Lee, Eric de Bodt, Vincent Wertz, and Michel Verleysen. Input data reduction for the prediction of financial time series. In M. Verleysen, editor, ESANN 2001, European Symposium on Artificial Neural Networks, Bruges (Belgique), pages 237–244. d-side publ. (Evere, Belgium), April 2001. |
|
97 | Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Gerhard Brewka, Cees Witteween, and Torsten Schaub, editors, Working Notes of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications, pages 102–113, Potsdam, Germany, April 2001. |
|
96 | Javier Esparza and Keijo Heljanko. Implementing LTL model checking with net unfoldings. Research Report A68, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2001. |
|
95 | Keijo Heljanko and Ilkka Niemelä. Answer set programming and bounded model checking. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 90–96, Stanford, USA, March 2001. AAAI Press. |
|
94 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Representing configuration knowledge with weight constraint rules. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming, pages 195–201, Stanford, USA, March 2001. AAAI Press. |
|
93 | Amaury Lendasse, Vincent Wertz, and Michel Verleysen. Forecasting electricity demand using kohonen maps. In 20th Benelux meeting on Systems and Control, Houffalize (Belgium), page 118, March 2001. |
|
92 | Catharina Candolin, Janne Lundberg, and Hannu Kari. Authorization and privacy protection in organizational ad hoc networks. In Proceedings of the 3rd Nordic Usenix Conference, Stockholm, Sweden, February 2001. |
|
91 | Pekka Nikander, Janne Lundberg, Catharina Candolin, and Tuomas Aura. Homeless mobile ipv6. Technical report, Internet Engineering Task Force, February 2001. Internet Draft, work in progress. |
|
90 | Lasse Anderson, Johannes Helander, Keijo Heljanko, Tomi Janhunen, Robert Jürgens, Ismo Kangas, Kari J. Nurmela, Kenneth Oksanen, Olavi Pesonen, Marko Rauhamaa, James Reilly, Heikki Suonsivu, Kimmo Valkealahti, Kimmo Varpaaniemi, and Pauli Väisänen. PROD 3.3.09 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, February 2001. Software. |
|
89 | Catharina Candolin, Janne Lundberg, and Hannu Kari. Authorization and privacy protection in organizational ad hoc networks. In Proceedings of the 3rd Nordic Usenix Conference, Stockholm, Sweden, February 2001. |
|
88 | Pekka Nikander, Janne Lundberg, Catharina Candolin, and Tuomas Aura. Homeless mobile ipv6. Technical report, Internet Engineering Task Force, February 2001. Internet Draft, work in progress. |
|
87 | Lasse Anderson, Johannes Helander, Keijo Heljanko, Tomi Janhunen, Robert Jürgens, Ismo Kangas, Kari J. Nurmela, Kenneth Oksanen, Olavi Pesonen, Marko Rauhamaa, James Reilly, Heikki Suonsivu, Kimmo Valkealahti, Kimmo Varpaaniemi, and Pauli Väisänen. PROD 3.3.09 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, February 2001. Software. |
|
86 | Amaury Lendasse, Eric de Bodt, Vincent Wertz, and Michel Verleysen. Nonlinear financial time series forecasting - application to the bel 20 stock market index. European Journal of Economic and Social Systems, 14(1):81–92, February 2001. |
|
85 | Antti Honkela. Nonlinear switching state-space models. Master's thesis, Helsinki University of Technology, Espoo, 2001. |
|
84 | Harri Valpola, Antti Honkela, and Juha Karhunen. Nonlinear static and dynamic blind source separation using ensemble learning. In Proc. Int. Joint Conf. on Neural Networks (IJCNN'01), pages 2750–2755, Washington D.C., USA, 2001. |
|
83 | Antti Honkela and Juha Karhunen. An ensemble learning approach to nonlinear independent component analysis. In Proc. European Conf. on Circuit Theory and Design (ECCTD'01), pages I–41–44, Espoo, Finland, 2001. |
|
82 | Timo Latvala. Model checking linear temporal logic properties of Petri nets with fairness constraints. Research Report A67, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, January 2001. |
|
81 | Toni Jussila. Bounded Model Checking for Verifying Concurrent Programs. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
80 | Maarit Hietalahti. Efficient key agreement for ad-hoc networks. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
79 | Jari Katajavuori. An architecture for dynamic software upgrading over-the-air in mobile systems. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
78 | Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
77 | Harri Kuusisto. Käyttäjän sähköinen tunnistaminen ja yksityisyys. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 2001. |
|
76 | Rauni Pääkkönen. Implementing a formal agent description language. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
75 | Veera Lehtonen. Implementation of a robust electronic voting system. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
74 | Viktor Rosendahl. A customized very long intruction word processor for Viterbi decoding. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2001. |
|
73 | Janne Olavi Salmi. An adaptive mobility management mechanism for ip networks using ad hoc routing. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 2001. |
|
72 | Kjell Sand. Development of unit and module testing in embedded systems. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
71 | Sami Olavi Virtanen. Effective long code generation in WCDMA. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2001. |
|
70 | Galina T. Bogdanova, Andries E. Brouwer, Stoian N. Kapralov, and Patric R.J. Östergård. Error-correcting codes over an alphabet of four elements. Designs, Codes and Cryptography, 23(3):333–342, 2001. |
|
69 | Galina T. Bogdanova and Patric R.J. Östergård. Bounds on codes over an alphabet of five elements. Discrete Mathematics, 240(1–3):13–19, 2001. |
|
68 | Alexander A. Davydov and Patric R.J. Östergård. Linear codes with covering radius and codimension . IEEE Transactions on Information Theory, 47(1):416–421, 2001. |
|
67 | Alexander A. Davydov and Patric R.J. Östergård. Recursive constructions of complete caps. Journal of Statistical Planning and Inference, 95(1–2):167–173, 2001. |
|
66 | T. Aaron Gulliver and Patric R.J. Östergård. Improved bounds for ternary linear codes of dimension 8 using tabu search. Journal of Heuristics, 7(1):37–46, 2001. |
|
65 | Patric R.J. Östergård. A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing, 8(4):424–436, 2001. |
|
64 | Patric R.J. Östergård. There are 270,474,142 nonisomorphic 2-(9,4,6) designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 37(1):173–176, 2001. |
|
63 | Patric R.J. Östergård and Uri Blass. On the size of optimal binary codes of length 9 and covering radius 1. IEEE Transactions on Information Theory, 47(6):2556–2557, 2001. |
|
62 | Patric R.J. Östergård and William D. Weakley. Values of domination numbers of the queen's graph. The Electronic Journal of Combinatorics, 8(1), 2001. |
|
61 | Tuomas Aura, Pekka Nikander, and Jussipekka Leiwo. DOS-resistant authentication with client puzzles. In B. Christianson, B. Crispo, J.A. Malcolm, and M. Roe, editors, Security Protocols, 8th International Workshop Cambridge, UK, April 2000, Revised Papers, volume 2133 of Lecture Notes in Computer Science, pages 170–177. Springer-Verlag, Berlin, Germany, 2001. |
|
60 | Tuomas Aura. DOS-resistant authentication with client puzzles (transcript of discussion). In B. Christianson, B. Crispo, J.A. Malcolm, and M. Roe, editors, Security Protocols, 8th International Workshop Cambridge, UK, April 2000, Revised Papers, volume 2133 of Lecture Notes in Computer Science, pages 178–181. Springer-Verlag, Berlin, Germany, 2001. |
|
59 | Marko Mäkelä. lsts2dot—a translator from TVT LSTS files to the input file language of GraphViz. on the World Wide Web, 2001. computer program. |
|
58 | Kimmo Varpaaniemi. Minimizing the number of successor states in the stubborn set method. In Ludwik Czaja, editor, Concurrency, Specification and Programming: Proceedings of the CS&P'2001 Workshop, Warsaw, Poland, 3–5 October 2001, pages 279–290. Zakład Graficzny UW, zam. 583/2001, Warsaw, Poland, 2001. |
|
57 | Jürgen Dix, Ulrich Furbach, and Ilkka Niemelä. Nonmonotonic reasoning: Towards efficient calculi and implementations. In Andrei Voronkov and Alan Robinson, editors, Handbook of Automated Reasoning, chapter 19, pages 1241–1354. Elsevier Science, Amsterdam, 2001. |
|
56 | Jaakko Peltonen. Self-organizing maps in learning metrics. Master's thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, 2001. Award-winning: Master's thesis award 2002 for best Finnish Master's thesis in technology, granted by Tekniikan Akateemisten Liitto TEK ry and Tekniska Föreningen i Finland TFiF r.f. |
|
55 | Keijo Heljanko. punroll 0.3: a bounded reachability checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
54 | Keijo Heljanko and Patrik Simons. boundsmodels 0.9: a bounded LTL model checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
53 | Keijo Heljanko and Patrik Simons. unfsmodels 0.9: a LTL model checker using net unfoldings. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
52 | Vesa Siivola, Mikko Kurimo, and Krista Lagus. Large vocabulary statistical language modeling for continuous speech recognition. In Proceedings of 7th European Conference on Speech Communication and Technology, Aalborg, Copenhagen, 2001. |
|
51 | Krista Lagus and Anu Airola. Analysis of functional similarities of finnish verbs using the self-organizing map. In Alessandro Lenci, Simonetta Montemagni, and Vito Pirelli, editors, Appeared in the ESSLLI'01 Workshop on The Acquisition and Representation of Word Meaning, 2001. |
|
50 | Kimmo Varpaaniemi. Minimizing the number of successor states in the stubborn set method. In Ludwik Czaja, editor, Concurrency, Specification and Programming: Proceedings of the CS&P'2001 Workshop, Warsaw, Poland, 3–5 October 2001, pages 279–290. Zakład Graficzny UW, zam. 583/2001, Warsaw, Poland, 2001. |
|
49 | Amaury Lendasse, John A. Lee, Vincent Wertz, Eric de Bodt, and Michel Verleysen. Dimension reduction of technical indicators for the prediction of financial time series, application to the bel 20 market index. European Journal of Economic and Social Systems, 15(2):31–48, 2001. |
|
48 | Leo Ojala, Teemu Tynjälä, and Harriet Beaver. Modeling Serial Quantum Processors Using High-Level Petri Nets. In Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics - SCI'2001, 2001. |
|
47 | Leo Ojala, Elina Parviainen, Olli-Matti Penttinen, Teemu Tynjälä, and Harriet Beaver. Modeling Feynman's Quantum Computer Using Stochastic High-Level Petri Nets. In Proceedings of 2001 IEEE International Conference on Systems, Man & Cybernetics (CD-ROM), pages 2735–2741, 2001. |
|
46 | H. Toivonen, K. Vasko, Heikki Mannila, A. Korhola, and H. Olander. Applying bayesian statistics to organism-based environmental reconstruction. Ecological Applications, 11(2):618–630, 2001. |
|
45 | Heikki Mannila and M. Salmenkivi. Finding simple intensity descriptions from event sequence data. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2001), pages 341–346, 2001. |
|
44 | I. Cadez, P. Smyth, and Heikki Mannila. Probabilistic modeling of transaction data with applications to profiling, visualization, and prediction. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2001), pages 37–46, 2001. |
|
43 | M. Koivisto and Heikki Mannila. Offspring risk and sibling risk for multilocus traits. Human Heredity, 51:209–216, 2001. |
|
42 | P. Sevon, V. Ollikainen, P. Onkamo, H. Toivonen, Heikki Mannila, and J. Kere. Mining associations between genetic markers, phenotypes and covariates. Genetic Epidemiology, 21(Suppl 1):S588 – S593, 2001. |
|
41 | E. Bingham and Heikki Mannila. Random projection in dimensionality reduction: applications to image and text data. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2001), pages 245–250, 2001. |
|
40 | J. Himberg, K. Korpiaho, Heikki Mannila, J. Tikanmäki, and H. Toivonen. Time-series segmentation for context recognition in mobile devices. In IEEE Conference on Data Mining, pages 203–207, 2001. |
|
39 | B. Bollobas, G. Das, D. Gunopulos, and H. Mannila. Time-series similarity problems and well-separated geometric sets. Nordic Journal on Computing, 8(4):409–423, 2001. |
|
38 | David Hand, Heikki Mannila, and Padhraic Smyth. Principles of Data Mining. MIT Press, 2001. ISBN 0-262-98290-X. |
|
37 | Vesa Siivola, Mikko Kurimo, and Krista Lagus. Large vocabulary statistical language modeling for continuous speech recognition. In Proceedings of 7th European Conference on Speech Communication and Technology (EUROSPEECH), pages 737–747, Aalborg, Copenhagen, 2001. |
|
36 | Chafic Mokbel, Hanna Greige, Charles Sarraf, and Mikko Kurimo. Document indexing and classification based on latent semantic analysis and self-organizing map. In Proceedings of the IEEE workshop on Natural Langage Processing in Arabic, Beirut, Lebanon, 2001. |
|
35 | Marko Mäkelä. lsts2dot—a translator from TVT LSTS files to the input file language of GraphViz. on the World Wide Web, 2001. computer program. |
|
34 | Matti Aksela, Jorma Laaksonen, Erkki Oja, and Jari Kangas. Application of adaptive committee classifiers in on-line character recognition. In ICAPR, pages 270–279, 2001. |
|
33 | Matti Aksela, Jorma Laaksonen, Erkki Oja, and Jari Kangas. Rejection methods for an adaptive committee classifier. In ICDAR, pages 982–986, 2001. |
|
32 | Visa Koivunen, Mihai Enescu, and Erkki Oja. Adaptive algorithm for blind separation from noisy time-varying mixtures. Neural Computation, 13(10):2339–2357, 2001. |
|
31 | Jorma Laaksonen, Markus Koskela, Sami Laakso, and Erkki Oja. Self-organising maps as a relevance feedback technique in content-based image retrieval. Pattern Anal. Appl., 4(2-3):140–152, 2001. |
|
30 | Timo Ojala, Kimmo Valkealahti, Erkki Oja, and Matti Pietikäinen. Texture discrimination with multidimensional distributions of signed gray-level differences. Pattern Recognition, 34(3):727–739, 2001. |
|
29 | Vuokko Vuori, Jorma Laaksonen, Erkki Oja, and Jari Kangas. Speeding up on-line recognition of handwritten characters by pruning the prototype set. In ICDAR, pages 501–, 2001. |
|
28 | Vuokko Vuori, Jorma Laaksonen, Erkki Oja, and Jari Kangas. Experiments with adaptation strategies for a prototype-based recognition system for isolated handwritten characters. IJDAR, 3(3):150–159, 2001. |
|
27 | Jiří Šíma and Pekka Orponen. Computing with continuous-time Liapunov systems. In J. S. Vitter, P. Spirakis, and M. Yannakakis, editors, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01, Crete, July 2001), pages 722–731, New York NY, 2001. Association for Computing Machinery. |
|
26 | Jiří Šíma and Pekka Orponen. Exponential transients in continuous-time symmetric Hopfield nets. In G. Dorffner, H. Bischof, and K. Hornik, editors, Proceedings of Artificial Neural Networks – ICANN 2001 (Vienna, August 2001), volume 2130 of Lecture Notes in Computer Science, pages 806–813, Berlin Heidelberg, 2001. Springer-Verlag. |
|
25 | Petteri Kaski and Patric R. J. Östergård. There exists no (15,5,4) RBIBD. Journal of Combinatorial Designs, 9(5):357–362, 2001. |
|
24 | Tapani Raiko. Hierarchical nonlinear factor analysis. Master's thesis, Helsinki University of Technology, Espoo, Finland, 2001. |
|
23 | Tapani Raiko and Harri Valpola. Missing values in nonlinear factor analysis. In Proc. of the 8th Int. Conf. on Neural Information Processing (ICONIP'01), pages 822–827, Shanghai, 2001. |
|
22 | Harri Valpola, Tapani Raiko, and Juha Karhunen. Building blocks for hierarchical latent variable models. In Proc. 3rd Int. Conf. on Independent Component Analysis and Signal Separation (ICA2001), pages 710–715, San Diego, USA, 2001. |
|
21 | J. Särelä, H. Valpola, R. Vigário, and E. Oja. Dynamical factor analysis of rhythmic magnetoencephalographic activity. In Proc. 3rd Int. Conf. on Independent Component Analysis and Blind Signal Separation (ICA'2001), pages 451–456, San Diego, California, USA, 2001. |
|
20 | J. Särelä and R. Vigário. The problem of overlearning in high-order ICA approaches: analysis and solutions. In Proc. Int. Workshop on Artificial Neural Networks (IWANN-2001), pages 818–825, Granada, Spain, 2001. |
|
19 | R. Vigário. From principal to independent component analysis of brain signals. In Proc. of 23rd Annual Int. Conf. of the IEEE Engineering and Medicine in Biology Society (EMBC2001), Istanbul, Turkey, 2001. |
|
18 | Samuel Kaski and Jarkko Salojärvi. Generative mixture modeling by autonomous estimators. In N. Baba, L. C. Jain, and R. J. Howlett, editors, Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies, Proceedings of KES'2001, volume 1, pages 250–254, Amsterdam, 2001. IOS Press. |
|
17 | Janne Nikkilä, Petri Törönen, Janne Sinkkonen, and Samuel Kaski. Analysis of gene expression data using semi-supervised clustering. In Proceedings of Bioinformatics 2001, Skövde, Sweden, March 29-April 1, pages 2–3, 2001. (Abstract). |
|
16 | Samuel Kaski, Janne Sinkkonen, and Janne Nikkilä. Clustering gene expression data by mutual information with gene function. In Georg Dorffner, Horst Bischof, and Kurt Hornik, editors, Artificial Neural Networks—ICANN 2001, pages 81–86, Berlin, 2001. Springer. |
|
15 | Jarkko Venna and Samuel Kaski. Neighborhood preservation in nonlinear projection methods: An experimental study. In Georg Dorffner, Horst Bischof, and Kurt Hornik, editors, Artificial Neural Networks—ICANN 2001, pages 485–491, Berlin, 2001. Springer. |
|
14 | Samuel Kaski. Learning metrics for exploratory data analysis. In David Miller, Tülay Adali, Jan Larsen, Marc Van Hulle, and Scott Douglas, editors, Neural Networks for Signal Processing XI, Proceedings of the 2001 IEEE Signal Processing Society Workshop, pages 53–62, New York, NY, 2001. IEEE. |
|
13 | Samuel Kaski, Janne Sinkkonen, and Jaakko Peltonen. Data visualization and analysis with self-organizing maps in learning metrics. In Yahiko Kambayashi, Werner Winiwarter, and Masatoshi Arikawa, editors, Proceedings of DaWaK'01, Third International Conference on Data Warehousing and Knowledge Discovery, pages 162–173, Berlin, 2001. Springer. (LNCS 2114). |
|
12 | Samuel Kaski, Janne Sinkkonen, and Jaakko Peltonen. Learning metrics for self-organizing maps. In Proceedings of IJCNN'01, International Joint Conference on Neural Networks, pages 914–919, Piscataway, NJ, 2001. IEEE. Preprint postscript at http://www.cis.hut.fi/projects/mi/papers/ijcnn01.ps.gz. |
|
11 | Samuel Kaski. SOM-based exploratory analysis of gene expression data. In Nigel Allinson, Hujun Yin, Lesley Allinson, and Jon Slack, editors, Advances in Self-Organizing Maps, pages 124–131, London, 2001. Springer. |
|
10 | Samuel Kaski and Janne Sinkkonen. A topography-preserving latent variable model with learning metrics. In Nigel Allinson, Hujun Yin, Lesley Allinson, and Jon Slack, editors, Advances in Self-Organizing Maps, pages 224–229, London, 2001. Springer. |
|
9 | Samuel Kaski, Janne Sinkkonen, and Jaakko Peltonen. Bankruptcy analysis with self-organizing maps in learning metrics. IEEE Transactions on Neural Networks, 12:936–947, 2001. Preprint postscript at http://www.cis.hut.fi/projects/mi/papers/trnn00_preprint.ps.gz. |
|
8 | Samuel Kaski, Janne Nikkilä, Petri Törönen, Eero Castren, and Garry Wong. Analysis and visualization of gene expression data using self-organizing maps. In Proceedings of NSIP-01, IEEE-EURASIP Workshop on Nonlinear Signal and Image Processing, 03.06.2001 - 06.06.2001, Baltimore, Maryland USA, 2001. Proceedings on CD-ROM. |
|
7 | Timo Honkela. Inhimillinen kone - konemainen ihminen, chapter Koneen äly, oppiminen ja viisaus (Machine intelligence, learning and wisdom), pages 18–32. Helsinki University Press, Helsinki, 2001. |
|
6 | Timo Latvala. Model checking LTL properties of high-level petri nets with fairness constraints. In J-M. Colom and M. Koutny, editors, Application and Theory of Petri Nets, pages 242–262, Berlin, 2001. Springer. [Copyright © Springer-Verlag] |
|
5 | Leo Ojala, Teemu Tynjälä, and Harriet Beaver. Modelling Serial Quantum Processors Using Petri Nets. In World Multiconference on Systemics, Cybernetics and Informatics SCI 2001, volume 14, 2001. |
|
4 | Leo Ojala, Elina Parviainen, Olli-Matti Penttinen, Harriet Beaver, and Teemu Tynjälä. Modelling Feynman's Quantum Computer Using Stochastic High Level Petri Nets. In Systems, Man and Cybernetics (SMC 2001), 2001. This article appears only in the CD-ROM version of the proceedings. |
|
3 | Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysing a Distributed Dynamic Channel Allocation Algorithm for Mobile Computing Using High-Level Net Methods. Software Tools for Technology Transfer, 3, 2001. |
|
2 | Tommi A. Junttila. Computational complexity of the Place/Transition-net symmetry reduction method. Journal of Universal Computer Science, 7(4):307–326, 2001. |
|
1 | Tommi Junttila. BCSat 0.3 - a satisfiability checker for boolean circuits. Computer program, 2001. |
|