default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrik Floréen
Person information
- affiliation: University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i7]Jaana Leikas, Patrik Floréen:
A Systematic Exercise Tool Helps Researchers Ponder the Ethical Implications of AI. ERCIM News 2022(131) (2022)- 2021
- [c34]Jonathan Strahl
, Jaakko Peltonen, Patrik Floréen:
Directing and Combining Multiple Queries for Exploratory Search by Visual Interactive Intent Modeling. INTERACT (3) 2021: 514-535
2010 – 2019
- 2018
- [j16]Salvatore Andolina, Khalil Klouche, Tuukka Ruotsalo, Patrik Floréen, Giulio Jacucci:
Querytogether: Enabling entity-centric exploration in multi-device collaborative search. Inf. Process. Manag. 54(6): 1182-1202 (2018) - [j15]Markus Koskela, Petri Luukkonen, Tuukka Ruotsalo, Mats Sjöberg, Patrik Floréen:
Proactive Information Retrieval by Capturing Search Intent from Primary Task Context. ACM Trans. Interact. Intell. Syst. 8(3): 20:1-20:25 (2018) - [j14]Tuukka Ruotsalo, Jaakko Peltonen, Manuel J. A. Eugster, Dorota Glowacka, Patrik Floréen, Petri Myllymäki, Giulio Jacucci, Samuel Kaski:
Interactive Intent Modeling for Exploratory Search. ACM Trans. Inf. Syst. 36(4): 44:1-44:46 (2018) - 2017
- [c33]Jaakko Peltonen, Jonathan Strahl, Patrik Floréen:
Negative Relevance Feedback for Exploratory Search with Visual Interactive Intent Modeling. IUI 2017: 149-159 - 2016
- [c32]Mats Sjöberg, Hung-Han Chen, Patrik Floréen, Markus Koskela, Kai Kuikkaniemi, Tuukka Lehtiniemi, Jaakko Peltonen:
Digital Me: Controlling and Making Sense of My Digital Footprint. Symbiotic 2016: 155-167 - [i6]Petri Luukkonen, Markus Koskela, Patrik Floréen:
LSTM-Based Predictions for Proactive Information Retrieval. CoRR abs/1606.06137 (2016) - 2015
- [c31]Salvatore Andolina, Khalil Klouche, Jaakko Peltonen, Mohammad E. Hoque, Tuukka Ruotsalo, Diogo Cabral, Arto Klami, Dorota Glowacka, Patrik Floréen, Giulio Jacucci:
IntentStreams: Smart Parallel Search Streams for Branching Exploratory Search. IUI 2015: 300-305 - 2014
- [j13]Petteri Nurmi, Antti Salovaara, Andreas Forsblom, Fabian Bohnert, Patrik Floréen:
PromotionRank: Ranking and Recommending Grocery Product Promotions Using Personal Shopping Lists. ACM Trans. Interact. Intell. Syst. 4(1): 1:1-1:23 (2014) - 2013
- [c30]Markus Löchtefeld, Petteri Nurmi, Florian Michahelles, Carsten Magerkurth, Patrik Floréen, Antonio Krüger:
PeTRE: workshop on pervasive technologies in retail environments. UbiComp (Adjunct Publication) 2013: 963-968 - 2012
- [c29]Sourav Bhattacharya, Patrik Floréen, Andreas Forsblom, Samuli Hemminki, Petri Myllymäki, Petteri Nurmi, Teemu Pulkkinen, Antti Salovaara:
Ma$$iv€ - An Intelligent Mobile Grocery Assistant. Intelligent Environments 2012: 165-172 - 2011
- [j12]Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, Jukka Suomela:
Local Approximability of Max-Min and Min-Max Linear Programs. Theory Comput. Syst. 49(4): 672-697 (2011) - 2010
- [j11]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm. Algorithmica 58(1): 102-118 (2010) - [c28]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Brief announcement: distributed almost stable marriage. PODC 2010: 281-282 - [e1]Patrik Floréen, Antonio Krüger, Mirjana Spasojevic:
Pervasive Computing, 8th International Conference, Pervasive 2010, Helsinki, Finland, May 17-20, 2010. Proceedings. Lecture Notes in Computer Science 6030, Springer 2010, ISBN 978-3-642-12653-6 [contents]
2000 – 2009
- 2009
- [c27]Petteri Nurmi, Andreas Forsblom, Patrik Floréen, Peter Peltonen, Petri Saarikko:
Predictive text input in a mobile shopping assistant: methods and interface design. IUI 2009: 435-438 - [c26]Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. SPAA 2009: 260-269 - [c25]Andreas Forsblom, Petteri Nurmi, Patrik Floréen, Peter Peltonen, Petri Saarikko:
Ma$$ive ─ An Intelligent Shopping Assistant. PMPC@UMAP 2009 - [c24]Petteri Nurmi, Andreas Forsblom, Patrik Floréen:
Grocery Product Recommendations from Natural Language Inputs. UMAP 2009: 235-246 - [c23]Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto:
A Local 2-Approximation Algorithm for the Vertex Cover Problem. DISC 2009: 191-205 - 2008
- [c22]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Tight Local Approximation Results for Max-Min Linear Programs. ALGOSENSORS 2008: 2-17 - [c21]Sourav Bhattacharya, Joonas Kukkonen, Petteri Nurmi, Patrik Floréen:
SerPens: a tool for semantically enriched location information on personal devices. BODYNETS 2008: 30 - [c20]Petteri Nurmi, Eemil Lagerspetz, Wray L. Buntine, Patrik Floréen, Joonas Kukkonen, Peter Peltonen:
Natural language retrieval of grocery products. CIKM 2008: 1413-1414 - [c19]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Approximating max-min linear programs with local algorithms. IPDPS 2008: 1-10 - [c18]Fredrik Boström, Patrik Floréen, Tianyan Liu, Petteri Nurmi, Tiina-Kaisa Oikarinen, Akos Vetek, Péter Boda:
Capricorn: an intelligent interface for mobile widgets. IUI 2008: 417-418 - [c17]Fredrik Boström, Petteri Nurmi, Patrik Floréen, Tianyan Liu, Tiina-Kaisa Oikarinen, Akos Vetek, Péter Boda:
Capricorn - an intelligent user interface for mobile widgets. Mobile HCI 2008: 327-330 - [c16]Petteri Nurmi, Eemil Lagerspetz, Wray L. Buntine, Patrik Floréen, Joonas Kukkonen:
Product retrieval for grocery stores. SIGIR 2008: 781-782 - [i5]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Tight local approximation results for max-min linear programs. CoRR abs/0804.4815 (2008) - [i4]Patrik Floréen, Marja Hassinen, Petteri Kaski, Jukka Suomela:
Local approximation algorithms for a class of 0/1 max-min linear programs. CoRR abs/0806.0282 (2008) - [i3]Patrik Floréen, Joel Kaasinen, Petteri Kaski, Jukka Suomela:
An optimal local approximation algorithm for max-min linear programs. CoRR abs/0809.1489 (2008) - [i2]Patrik Floréen, Petteri Kaski, Valentin Polishchuk, Jukka Suomela:
Almost stable matchings in constant time. CoRR abs/0812.4893 (2008) - 2007
- [c15]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Local Approximation Algorithms for Scheduling Problems in Sensor Networks. ALGOSENSORS 2007: 99-113 - [c14]Petteri Nurmi, Joonas Kukkonen, Eemil Lagerspetz, Jukka Suomela, Patrik Floréen:
BeTelGeuse: a tool for Bluetooth data gathering. BODYNETS 2007: 21 - [c13]Patrik Floréen, Petteri Kaski, Jukka Suomela:
A distributed approximation scheme for sleep sceduling in sensor networks. SECON 2007: 152-161 - [i1]Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela:
Approximating max-min linear programs with local algorithms. CoRR abs/0710.1499 (2007) - 2005
- [j10]Petri Nokelainen, Miikka Miettinen, Jaakko Kurhila, Patrik Floréen, Henry Tirri:
A shared document-based annotation tool to support learner-centred collaborative learning. Br. J. Educ. Technol. 36(5): 757-770 (2005) - [j9]Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen:
Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE J. Sel. Areas Commun. 23(1): 117-126 (2005) - [j8]Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen:
Exact and approximate balanced data gathering in energy-constrained sensor networks. Theor. Comput. Sci. 344(1): 30-46 (2005) - [c12]Petteri Nurmi, Michael Przybilski, Greger Lindén, Patrik Floréen:
An Architecture for Distributed Agent-Based Data Preprocessing. AIS-ADM 2005: 123-133 - [c11]Michael Przybilski, Petteri Nurmi, Patrik Floréen:
A Framework for Context Reasoning Systems. IASTED Conf. on Software Engineering 2005: 448-452 - [c10]Petteri Nurmi, Michael Przybilski, Greger Lindén, Patrik Floréen:
A Framework for Distributed Activity Recognition in Ubiquitous Systems. IC-AI 2005: 650-655 - 2004
- [c9]Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen:
Balanced Data Gathering in Energy-Constrained Sensor Networks. ALGOSENSORS 2004: 59-70 - 2003
- [c8]Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen:
Multicast time maximization in energy constrained wireless networks. DIALM-POMC 2003: 50-58 - [c7]Petri Nokelainen, Jaakko Kurhila, Miikka Miettinen, Patrik Floréen, Henry Tirri:
Evaluating the Role of a Shared Document-Based Annotation Tool in Learner-Centered Collaborative Learning. ICALT 2003: 200-203 - [c6]Miikka Miettinen, Petri Nokelainen, Patrik Floréen, Henry Tirri, Jaakko Kurhila:
EDUCOSM -Personalized Writable Web for Learning Communities. ITCC 2003: 37-42 - [c5]Jaakko Kurhila, Miikka Miettinen, Petri Nokelainen, Patrik Floréen, Henry Tirri:
Peer-to-peer learning with open-ended writable Web. ITiCSE 2003: 173-177
1990 – 1999
- 1999
- [j7]Walter A. Kosters, Joost N. Kok, Patrik Floréen:
Fourier Analysis of Genetic Algorithms. Theor. Comput. Sci. 229(1): 143-175 (1999) - 1995
- [c4]Joost N. Kok, Patrik Floréen:
Tracing the Behavior of Genetic Algorithms Using Expected Values of Bit and Walsh Products. ICGA 1995: 201-208 - 1993
- [j6]Patrik Floréen, Pekka Orponen:
Attraction Radii in Binary Hopfield Nets are Hard to Compute. Neural Comput. 5(5): 812-821 (1993) - 1992
- [j5]Patrik Floréen:
A new neural associative memory model. Int. J. Intell. Syst. 7(5): 455-467 (1992) - 1991
- [j4]Patrik Floréen:
The convergence of Hamming memory networks. IEEE Trans. Neural Networks 2(4): 449-457 (1991) - [j3]Patrik Floréen:
Worst-case convergence times for Hopfield memories. IEEE Trans. Neural Networks 2(5): 533-535 (1991) - 1990
- [j2]Patrik Floréen, Petri Myllymäki, Pekka Orponen, Henry Tirri:
Compiling Object Declarations into Connectionist Networks. AI Commun. 3(4): 172-183 (1990) - [c3]Henry Tirri, Petri Myllymäki, Pekka Orponen, Patrik Floréen:
Programming Methods for Neural Computing. Dagstuhl Seminar on Parallelization in Inference Systems 1990: 357 - [c2]Pekka Orponen, Patrik Floréen, Petri Myllymäki, Henry Tirri:
A neural implementation of conceptual hierarchies with Bayesian reasoning. IJCNN 1990: 297-303 - [c1]Patrik Floréen:
An analysis of the convergence time of Hamming memory networks. IJCNN 1990: 867-872
1980 – 1989
- 1989
- [j1]Patrik Floréen, Pekka Orponen:
On the Computational Complexity of Analyzing Hopfield Nets. Complex Syst. 3(6) (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
