Helsinki ICT Research Events

Mika Göös, University of Toronto, Canada

In the basic model of communication complexity, two players, Alice and Bob, receive some inputs x and y, respectively. Their goal is to engage in a dialogue over a shared communication channel in order to compute some joint function f(x,y) of the inputs. How many bits must be transmitted between the players?

In addition to the obvious applications (communication...

Abstract:

In the basic model of communication complexity, two players, Alice and Bob, receive some inputs x and y, respectively. Their goal is to engage in a dialogue over a shared communication channel in order to compute some joint function f(x,y) of the inputs. How many bits must be transmitted between the players?

In addition to the obvious...

Interpersonal boundary regulation constitutes of the efforts needed to make the world work that is, for people to achieve contextually desirable degrees of social interaction and to build and sustain their relations with others and with the self. I argue that while widespread adoption of social network services (SNSs) disrupts central premises of...

Dr. Alexandru Tomescu, University of Helsinki

Multi-assembly problems have gathered much attention in the last years, as Next-Generation Sequencing technologies have started being applied to mixed settings, such as reads from the transcriptome (RNA-Seq), or from viral quasi-species. One classical model that has resurfaced in many multi-assembly methods (e.g. in Cufflinks, ShoRAH, BRANCH,...

Abstract:
Multi-assembly problems have gathered much attention in the last years, as Next-Generation Sequencing technologies have started being applied to mixed settings, such as reads from the transcriptome (RNA-Seq), or from viral quasi-species. One classical model that has resurfaced in many multi-assembly methods (e.g. in Cufflinks, ShoRAH, BRANCH, CLASS) is the...

Title
Deterministic Schemes for Membership in the Bitprobe Model

Abstract
Buhrman, Miltersen, Radhakrishnan and Venkatesh [SICOMP 2002] initiated the study of space bounds for the membership problem in the bitprobe model, presenting both randomized and deterministic schemes for storing a set of size n from a universe of size m such that membership queries on the set can be answered in t bit probes. Since...

M.Sc. Jefrey Lijffijt will defend his doctoral dissertation Computational methods for comparison and exploration of event sequences on 16 December 2013 in lecture hall T2 (Computer Science building). The opponent is Prof. Bart Goethals, Universiteit Antwerpen, Belgium. The custodian is Prof. Juho Rousu.

Announcement (fi, PDF)