This event feed aggregates content from the Research Events feeds from the Helsinki Institute for Information Technology HIIT, Aalto University Department of Computer Science, and the University of Helsinki Department of Computer Science.
-
28.05.2016 11:00–16:00
Other event
Computer Science building, Konemiehentie 2, EspooCan you solve algorithmic programming challenges, efficiently and correctly, in practice, as a team, under time pressure?
The contest is open to everyone, including university students, high-school students, and teams from companies.
Registration is now open: please fill in this form!
... -
28.05.2016 10:00–15:00
Event
Otaniemi, EspooCan you solve algorithmic programming challenges, efficiently and correctly, in practice, as a team, under time pressure?
The contest is open to everyone, including university students, high-school students, and teams from companies.
See the contest web page for more information.
-
Can you solve algorithmic programming challenges, efficiently and correctly, in practice, as a team, under time pressure?
The contest is open to everyone, including university students, high-school students, and teams from companies.
Organised in collaboration with University of Helsinki & Aalto University.
See the contest web page for more information.
-
27.05.2016 14:00–17:00
Defence of thesis
Exactum, Auditorium B123, Gustaf Hällströmin katu 2b
-
27.05.2016 10:15–11:00
HIIT seminar
Exactum B119Abstract:
Stochastic COntext Tree (abbreviated as SCOT) is m-Markov Chain with every state of a string independent of the symbols in its more remote past than the context of length determined by the preceding symbols of this state. SCOT has also appeared in other fields under various names (VLMC, PST, CTW) for compression applications. Consistency of algorithms for...
-
27.05.2016 10:15–11:00
HIIT seminar
Exactum B119Abstract:
Stochastic COntext Tree (abbreviated as SCOT) is m-Markov Chain with every state of a string independent of the symbols in its more remote past than the context of length determined by the preceding symbols of this state. SCOT has also appeared in other fields under various names (VLMC, PST, CTW) for compression applications. Consistency of algorithms for training SCOT have been derived for stationary time...
-
Data security under coercion and physical attacks
Speaker: Mohammad Mannan
Speaker affiliation: Concordia University, Montreal, Canada
Host: Prof. N. Asokan
Time: 10:15 (coffee at 10:00)
Venue: T2 in CS buildingData security under coercion and physical attacks
Abstract
We have been exploring several solutions for...
-
23.05.2016 14:15–16:00
Guest lecture
B222, ExactumAbstract:Keyword search in XML has gained popularity as it provides a user-friendly and easy way for users to query the XML data. Existing XML keyword search approaches on XML trees such as Lowest Common Ancestor (LCA), SLCA, MLCA, VLCA, and ELCA, are all LCA-based and they rely on the hierarchical structure of the XML document. This causes serious problems in processing XML keyword... -
Department of Computer Science
MSc Thesis Presentations Mon 23 May 2016, A106 (CS Building):14:00-14:30 Tuukka Haapaniemi
Topic: "Maintainable architecture in project business analysis software"
Supervisor: Prof. Eljas Soisalon-Soininen14:30-15:00 Roman Filippov
Topic: "Security model for the Open Messaging Interface (O-MI) Protocol"
Supervisor: Prof. Kary Främling15:00-15:30 Samuli Vuorinen
Topic: "... -
K. Bhattacharya: Quantifying social compensation under risks of relationship weakening
Speaker: Kunal Bhattacharya
Time: Monday 23 May at 11-12
Venue: Lecture hall AS3, TUAS building
Quantifying social compensation under risks of relationship weakening
Social networks require active relationship maintenance if they are to be...
Pages
