Patrik Floréen
Patrik Floréen
University of Helsinki and Aalto University
Bestätigte E-Mail-Adresse bei helsinki.fi - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A shared document‐based annotation tool to support learner‐centred collaborative learning
P Nokelainen, M Miettinen, J Kurhila, P Floréen, H Tirri
British Journal of Educational Technology 36 (5), 757-770, 2005
1092005
Towards a context management framework for MobiLife
P Floréen, M Przybilski, P Nurmi, J Koolwaaij, A Tarlano, M Wagner, ...
Proc. 14th IST Mobile & Wireless Summit 2005, 20-28, 2005
822005
Reasoning in context-aware systems
P Nurmi, P Floréen
Helsinki Institute for Information Technology, Position paper, 2004
702004
Multicast time maximization in energy constrained wireless networks
P Floréen, P Kaski, J Kohonen, P Orponen
Proceedings of the 2003 joint workshop on Foundations of mobile computing, 50-58, 2003
702003
Lifetime maximization for multicasting in energy-constrained wireless networks
P Floréen, P Kaski, J Kohonen, P Orponen
IEEE Journal on Selected Areas in Communications 23 (1), 117-126, 2005
642005
Evaluating the role of a shared document-based annotation tool in learner-centered collaborative learning
P Nokelainen, J Kurhila, M Miettinen, P Floréen, H Tirri
Proceedings 3rd IEEE International Conference on Advanced Technologies, 200-203, 2003
622003
A local 2-approximation algorithm for the vertex cover problem
M Åstrand, P Floréen, V Polishchuk, J Rybicki, J Suomela, J Uitto
International symposium on distributed computing, 191-205, 2009
492009
Balanced data gathering in energy-constrained sensor networks
E Falck, P Floréen, P Kaski, J Kohonen, P Orponen
International Symposium on Algorithms and Experiments for Sensor Systems …, 2004
472004
Almost stable matchings by truncating the Gale–Shapley algorithm
P Floréen, P Kaski, V Polishchuk, J Suomela
Algorithmica 58 (1), 102-118, 2010
442010
On the computational complexity of analyzing Hopfield nets
P Floréen, P Orponen
Complex Systems, 1989
441989
The convergence of Hamming memory networks
P Floreen
IEEE transactions on neural networks 2 (4), 449-457, 1991
431991
Attraction radii in binary Hopfield nets are hard to compute
P Floréen, P Orponen
Neural Computation 5 (5), 812-821, 1993
381993
EDUCOSM-Personalized writable web for learning communities
M Miettinen, P Nokelainen, P Floréen, H Tirri, J Kurhila
Proceedings ITCC 2003. International Conference on Information Technology …, 2003
302003
Product retrieval for grocery stores
P Nurmi, E Lagerspetz, W Buntine, P Floréen, J Kukkonen
Proceedings of the 31st annual international ACM SIGIR conference on …, 2008
292008
Context-aware group management in mobile environments
O Coutand, O Droegehorn, K David, P Nurmi, P Floréen, R Kernchen, ...
IST Mobile Summit, 2005
262005
Complexity issues in discrete Hopfield networks
P Floreen, P Orponen
261994
Intentstreams: smart parallel search streams for branching exploratory search
S Andolina, K Klouche, J Peltonen, M Hoque, T Ruotsalo, D Cabral, ...
Proceedings of the 20th international conference on intelligent user …, 2015
252015
Capricorn-an intelligent user interface for mobile widgets
F Boström, P Nurmi, P Floréen, T Liu, TK Oikarinen, A Vetek, P Boda
Proceedings of the 10th international conference on Human computer …, 2008
252008
Exact and approximate balanced data gathering in energy-constrained sensor networks
P Floréen, P Kaski, J Kohonen, P Orponen
Theoretical computer science 344 (1), 30-46, 2005
252005
Interactive intent modeling for exploratory search
T Ruotsalo, J Peltonen, MJA Eugster, D Głowacka, P Floréen, P Myllymäki, ...
ACM Transactions on Information Systems (TOIS) 36 (4), 1-46, 2018
232018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20