Player is loading...

Embed

Embed code

Transcriptions

Note: this content has been automatically generated.
00:00:01
hi everyone i'm i doubt i'm working on totally got
00:00:04
computers line yes and a specifically on designing sobbing yeah algorithms
00:00:11
these are bad like any use for processing massive
00:00:14
data sets because not be guitar coming from different sources
00:00:18
such as a sign that sports video s. d. or
00:00:21
sensor networks broadcast to the conjugate efficiency of classic algorithms
00:00:27
in most of this interview was that you put these two large that it doesn't feed into a memory everything and mostly
00:00:34
body challenge to parties and the data between different machines because of the communication button thing
00:00:40
so make one you know me i thought about good yes and even
00:00:43
sometimes you necktie mad good games become slow liked the whole thing is that
00:00:50
we need a new set up that word is that can operate feet
00:00:53
very constrained that the sources which is much smaller than the size of the
00:00:59
that's what it is often maintain a small but accurate so i
00:01:03
mean you just get up the data and computers solution based on that
00:01:07
over the past decade sopping actually don't have received much
00:01:11
attention and what i think is that is the got problems
00:01:15
oh i bet my then it or not is this needs new techniques for as any more complex queries
00:01:21
that usually costs on the inputs like not scraps or large matches
00:01:27
for example you might want to approximate the cluster structure of a large graph
00:01:32
or to maintain yes more somebody other dynamically updated graphic
00:01:37
like what's to design a few cents obvious who stands for
00:01:41
fundamental craft processing probably as central to my then data analysis
00:01:46
that i thought might block include and assaulting your time
00:01:50
had with them for understanding crossed the structure of crafts
00:01:54
it's even at good old for data summarisation and fast is getting
00:01:58
as good a photograph processing in dynamic just speeds there remain many
00:02:03
i don't exciting that it says that about attack i would be

Share this talk: 


Conference Program

Welcome address
Martin Vetterli, President of EPFL
6 June 2019 · 9:48 a.m.
Introduction
James Larus, Dean of IC School, EPFL
6 June 2019 · 9:58 a.m.
Introduction
Jean-Pierre Hubaux, IC Research Day co-chair
6 June 2019 · 10:07 a.m.
Adventures in electronic voting research
Dan Wallach, Professor at Rice University, Houston, USA
6 June 2019 · 10:14 a.m.
When foes are friends: adversarial examples as protective technologies
Carmela Troncoso, Assistant Professor at EPFL
6 June 2019 · 11:09 a.m.
Low-Latency Metadata Protection for Organizational Networks
Ludovic Barman, LCA1|DeDiS, EPFL
6 June 2019 · noon
Interactive comparison-based search, and who-is-th.at
Daniyar Chumbalov, INDY 1, EPFL
6 June 2019 · 12:06 p.m.
Decentralized, Secure and Verifiable Data Sharing
David Froelicher, LCA1|DeDiS, EPFL
6 June 2019 · 12:09 p.m.
Communication Efficient Decentralised Machine Learning
Anastasia Koloskova, MLO, EPFL
6 June 2019 · 12:11 p.m.
Detecting the Unexpected via Image Resynthesis
Krzysztof Lis, CVLab, EPFL
6 June 2019 · 12:14 p.m.
Sublinear Algorithms for Graph Processing
Aida Mousavifar, THL4, EPFL
6 June 2019 · 12:16 p.m.
Protecting the Metadata of Your Secret Messages
Kirill Nikitin, DEDIS, EPFL
6 June 2019 · 12:18 p.m.
Teaching a machine learning algorithm faster
Farnood Salehi, INDY 2, EPFL
6 June 2019 · 12:21 p.m.
Secure Microarchitectural Design
Atri Bhattacharyya, PARSA/HexHive, EPFL
6 June 2019 · 12:23 p.m.
Security testing hard to reach code
Mathias Payer, Assistant Professor at EPFL
6 June 2019 · 1:50 p.m.
Best Research Presentation Award Ceremony
Bryan Ford, Jean-Pierre Hubaux, Deirdre Rochat, EPFL
6 June 2019 · 3:54 p.m.