The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patrik Floréen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Petteri Nurmi, Michael Przybilski, Greger Lindén, Patrik Floréen
    An Architecture for Distributed Agent-Based Data Preprocessing. [Citation Graph (0, 0)][DBLP]
    AIS-ADM, 2005, pp:123-133 [Conf]
  2. Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
    Balanced Data Gathering in Energy-Constrained Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:59-70 [Conf]
  3. Henry Tirri, Petri Myllymäki, Pekka Orponen, Patrik Floréen
    Programming Methods for Neural Computing. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Parallelization in Inference Systems, 1990, pp:357- [Conf]
  4. Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
    Multicast time maximization in energy constrained wireless networks. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2003, pp:50-58 [Conf]
  5. Michael Przybilski, Petteri Nurmi, Patrik Floréen
    A Framework for Context Reasoning Systems. [Citation Graph (0, 0)][DBLP]
    IASTED Conf. on Software Engineering, 2005, pp:448-452 [Conf]
  6. Petteri Nurmi, Michael Przybilski, Greger Lindén, Patrik Floréen
    A Framework for Distributed Activity Recognition in Ubiquitous Systems. [Citation Graph (0, 0)][DBLP]
    IC-AI, 2005, pp:650-655 [Conf]
  7. 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. [Citation Graph (0, 0)][DBLP]
    ICALT, 2003, pp:200-203 [Conf]
  8. Joost N. Kok, Patrik Floréen
    Tracing the Behavior of Genetic Algorithms Using Expected Values of Bit and Walsh Products. [Citation Graph (0, 0)][DBLP]
    ICGA, 1995, pp:201-208 [Conf]
  9. Miikka Miettinen, Petri Nokelainen, Patrik Floréen, Henry Tirri, Jaakko Kurhila
    EDUCOSM -Personalized Writable Web for Learning Communities. [Citation Graph (0, 0)][DBLP]
    ITCC, 2003, pp:37-42 [Conf]
  10. Patrik Floréen, Petteri Kaski, Jukka Kohonen, Pekka Orponen
    Exact and approximate balanced data gathering in energy-constrained sensor networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:344, n:1, pp:30-46 [Journal]
  11. Walter A. Kosters, Joost N. Kok, Patrik Floréen
    Fourier Analysis of Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:229, n:1, pp:143-175 [Journal]
  12. Patrik Floréen, Petteri Kaski, Topi Musto, Jukka Suomela
    Approximating max-min linear programs with local algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  13. Local Approximation Algorithms for Scheduling Problems in Sensor Networks. [Citation Graph (, )][DBLP]


  14. Tight Local Approximation Results for Max-Min Linear Programs. [Citation Graph (, )][DBLP]


  15. Natural language retrieval of grocery products. [Citation Graph (, )][DBLP]


  16. Approximating max-min linear programs with local algorithms. [Citation Graph (, )][DBLP]


  17. Capricorn: an intelligent interface for mobile widgets. [Citation Graph (, )][DBLP]


  18. Predictive text input in a mobile shopping assistant: methods and interface design. [Citation Graph (, )][DBLP]


  19. Capricorn - an intelligent user interface for mobile widgets. [Citation Graph (, )][DBLP]


  20. Brief announcement: distributed almost stable marriage. [Citation Graph (, )][DBLP]


  21. Product retrieval for grocery stores. [Citation Graph (, )][DBLP]


  22. An optimal local approximation algorithm for max-min linear programs. [Citation Graph (, )][DBLP]


  23. Grocery Product Recommendations from Natural Language Inputs. [Citation Graph (, )][DBLP]


  24. A Local 2-Approximation Algorithm for the Vertex Cover Problem. [Citation Graph (, )][DBLP]


  25. Peer-to-peer learning with open-ended writable Web. [Citation Graph (, )][DBLP]


  26. A distributed approximation scheme for sleep sceduling in sensor networks. [Citation Graph (, )][DBLP]


  27. Tight local approximation results for max-min linear programs [Citation Graph (, )][DBLP]


  28. Local approximation algorithms for a class of 0/1 max-min linear programs [Citation Graph (, )][DBLP]


  29. An optimal local approximation algorithm for max-min linear programs [Citation Graph (, )][DBLP]


  30. Almost stable matchings in constant time [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002