Society has reached a point of no return, one that leaves us completely reliant on omnipresent ICT-mediated communication. Mobile and sensor-rich portable devices connect millions of humans with Petabytes of data and numerous on-line services. However, tearing down the physical-digital barrier in a scalable fashion requires both radically novel algorithmic knowledge and in-depth understanding of humans and societies. We will deliver major theoretical advances in real-time intelligent information management of large datasets including online social networks, mobile devices and humans in physical space by delivering three functions: “alert”, by real-time location-aware knowledge acquisition, analysis and visualization; “response”, through on-demand composition and coordination of large teams; and effective “communication”, through recommendation and personalization.
Publication date
2016
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 9941 L, pp. 207-219. ISSN 0302-9743
In: 33rd International Symposium on Computational Geometry, SoCG 2017 Leibniz International Proceedings in Informatics, LIPIcs (77) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 20:1-20:15. ISSN 1868-8969
An approximation algorithm for the art gallery problem
In: K + K = 120. Papers dedicated to László Kálmán and András Kornai on the occasion of their 60th birthdays Research Institute for Linguistics, Hungarian Academy of Sciences (RIL HAS), Budapest, pp. 1-16.
Building word embeddings from dictionary definitions
In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) Leibniz International Proceedings in Informatics (LIPIcs) (55) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 27:1-27:14. ISSN 1868-8969
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
In: Proceedings of the 1st Workshop on Evaluating Vector-Space Representations for NLP Association for Computational Linguistics, Stroudsburg, pp. 78-82.
Evaluating embeddings on dictionary-based similarity
In: 8th International Conference on Fun with Algorithms, FUN 2016 Leibniz International Proceedings in Informatics, LIPIcs (49) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 4:1-4:17. ISSN 1868-8969
Hanabi is NP-complete, even for cheaters who look at their cards