Concept

Text messaging

Related publications (123)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Single-server Multi-user Private Information Retrieval with Side Information

Michael Christoph Gastpar, Su Li

In the problem of private information retrieval with side information, a single user wants to recover one of the K independent messages which are stored at one or multiple servers. The user initially has a subset of messages as side information. The goal o ...

2018

Axo: Detection and Recovery for Delay and Crash Faults in Real-Time Control Systems

Jean-Yves Le Boudec, Simon Bliudze, Wajeb Saab

Real-time control systems use controllers that compute and issue setpoints within stringent delay constraints. Failure to do so, due to a crash or delay as a result of software and/or hardware faults, can cause failure of the controlled resources. Recently ...

2018

Atom: Horizontally Scaling Strong Anonymity

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Atom is an anonymous messaging system that protects against traffic-analysis attacks. Unlike many prior systems, each Atom server touches only a small fraction of the total messages routed through the network. As a result, the system’s capacity scales near ...

Association for Computing Machinery2017

, , , ,

Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...

2017

Revealing Information by Averaging

Sabine Süsstrunk, Roger Hersch, Mahmut Sami Arpa

We present a method for hiding images in synthetic videos and reveal them by temporal averaging. The main challenge is to develop a visual masking method that hides the input image both spatially and temporally. Our masking approach consists of temporal an ...

Optical Soc Amer2017

Right On Time Distributed Shared Memory

Rachid Guerraoui, David Kozhaya, Yvonne Anne Pignolet-Oswald

The demand for real-time data storage in distributed control systems (DCSs) is growing. Yet, providing real- time DCS guarantees is challenging, especially when more and more sensor and actuator devices are connected to industrial plants and message loss n ...

2016

Computation in Multicast Networks: Function Alignment and Converse Theorems

Michael Christoph Gastpar, Naveen Goela

The classical problem in a network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers that decode the same set of messages. In this paper, computation over multicast networks ...

Institute of Electrical and Electronics Engineers2016

Online social media is changing the personnel recruitment process. Until now, resumes were among the most widely used tools for the screening of job applicants. The advent of inexpensive sensors combined with the success of online video platforms has enabl ...

2016

Sentiment Classification of Tweets using Hierarchical Classification

Afroze Ibrahim Baqapuri

This paper addresses the problem of sentiment classification of short messages on microblogging platforms. We apply machine learning and pattern recognition techniques to design and implement a classification system for microblog messages assigning them in ...

Ieee2016

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

Ieee-Inst Electrical Electronics Engineers Inc2015