Helsinki ICT Research Events

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.

  • 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, T2

    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....

  • 04.12.2013 12:00–16:00
    Doctoral dissertation
    Helsinki University Main Building, Auditorium XV, Unioninkatu 3

    In 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...

  • 02.12.2013 13:15–14:00
    HIIT seminar
    Aalto University, Computer Science Building, T2

    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
    ...

  • Toward Brain Computer Interfaces

    Professor Klaus-Robert Müller, Technical University (TU) Berlin, Germany

     

    Abstract:

    Brain Computer Interfacing makes use of brain signals for the control of objects (e.g., wheel chairs), spelling, computer gaming, and other applications. This talk will provide a brief overview of current Brain Computer Interface technology. In particular, it will show the wealth, complexity and difficulties of the data available. The challenge is enormous:...

  • 29.11.2013 16:15–17:15
    Guest lecture
    T1, Aalto CS Building, Konemiehentie 2, Espoo

    This is the sixth lecture of Helsinki Distinguished Lecture Series on Future Information Technology.  The lecture is organized jointly with the Aalto Brain Centre (ABC).

    The event is open for everybody. Registration (for logistic purposes):...

  • 29.11.2013 10:15–11:00
    HIIT seminar
    Exactum, B119
    Title
    Normalized Random Measures and Extensions
     
    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...
  • 28.11.2013 13:15–14:00
    HIIT seminar
    Exactum, CK111
    Title
    Min-Sum 2-Paths Problems
     
    Abstract
    An orientation of an undirected graph $G$ is a directed graph obtained by replacing each edge $\{u,v\}$ of $G$ by exactly one of the arcs $(u,v)$ or $(v,u)$.
     
    In the min-sum $2$-paths orientation problem, the input is an undirected graph $G$ and two ordered pairs $(s_1,t_1)$, $(s_2,t_2)$....
  • Towards Facilitating the Development of Monitoring Systems with Low-Cost Autonomous Mobile Robots

    Prof. Einoshin Suzuki, Kyushu University, Japan

    Abstract:

    I will present our ongoing work towards facilitating the development of monitoring systems with low cost autonomous mobile robots by unifying techniques from data mining and databases. Such a system is less invasive to privacy, more flexible to changes, and more focused in its observation. However, it is subject to major obstacles...

Pages

Add to My Calendar