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.
-
13.12.2013 10:15–11:00
HIIT seminar
Exactum, B119TitleNon-linear systems in the spacing of musical scoresAbstractCurrently, an extension of Donald Knuth’s “Box and Glue” spacing algorithm called the “Spring and Rods” algorithm is used for the horizontal and vertical spacing of musical notation in three major open source music typesetting projects (LilyPond, MuseScore and Guido... -
13.12.2013 10:15–11:00
HIIT seminar
Exactum, B119Title
Non-linear systems in the spacing of musical scoresAbstract
Currently, an extension of Donald Knuth’s “Box and Glue” spacing algorithm called the “Spring and Rods” algorithm is used for the horizontal and vertical spacing of musical notation in three major open source music typesetting projects (LilyPond, MuseScore and Guido). All of these programs treat spacing... -
12.12.2013 12:00–16:00
Doctoral dissertation
Physicum E204, Kumpula, HelsinkiWithin the field of computer science, data centers (DCs) are a major consumer of energy. A large part of that energy is used for cooling down the exhaust heat of the servers contained in the DCs. This thesis describes both the aggregate numbers of DCs and key flagship installations in detail. We then introduce the concept of Data Center Energy Retrofits, a set of low cost, easy to install...
-
12.12.2013 12:00–16:00
Defence of thesis
Physicum, Auditorium E204, Gustaf Hällströmin katu 2
-
11.12.2013 16:30–17:30
Guest lecture
D122, ExactumGuest Lecture
Prof. Jon Crowcroft, University of Cambridge
Innovative Business Cases & The Internet of Things
or
How to put Linear Types, Control Theory and Bigraphs into one neat storyline
Wednesday, 11.12.2013 at 16:30
Room D122, Exactum
... -
New lower bounds for distributed algorithms
Dr. Jukka Suomela, University of Helsinki
Abstract:Distributed graph algorithms solve problems that are related to the structure of an unknown communication graph. Each node of the graph is a computer. Initially, each node is only aware of the edges incident to it, but it can learn more about the structure of the graph by exchanging messages with its neighbours. Eventually, each node has to stop and produce a local output. The local...
-
09.12.2013 13:15–14:00
HIIT seminar
Aalto University, Computer Science Building, T2Abstract:
Distributed graph algorithms solve problems that are related to the structure of an unknown communication graph. Each node of the graph is a computer. Initially, each node is only aware of the edges incident to it, but it can learn more about the structure of the graph by exchanging messages with its neighbours. Eventually, each node has to stop and produce a local output.... -
04.12.2013 12:00–16:00
Defence of thesis
University of Helsinki Main Building, Auditorium XV, Unioninkatu 34
-
04.12.2013 12:00–16:00
Doctoral dissertation
Helsinki University Main Building, Auditorium XV, Unioninkatu 3In scientific investigations data oftentimes have different nature. For instance, they might originate from distinct sources or be cast over separate terminologies. In order to gain insight into the phenomenon of interest, a natural task is to identify the correspondences that exist between these different aspects.
This is the motivating idea of... -
Normalized Random Measures and Extensions
Changyou Chen, Australian National University & NICTA
Abstract:The normalized random measure is a large class of random probability measures that has appealing properties and wide applications in Bayesian nonparametrics. In this talk I will review the Poisson process, completely random measures, and how to construct normalized random measure from them. I will then talk about its posterior characterization, and how to construct dependent...
Pages
