Publications associées à Circuit complexity

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

On the Error Rate of the LoRa Modulation With Interference

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Orion Afisiadis, Matthieu Cotting

LoRa is a chirp spread-spectrum modulation developed for the Internet of Things (IoT). In this work, we examine the performance of LoRa in the presence of both additive white Gaussian noise and interference from another LoRa user. To this end, we extend an ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Mikhail Kapralov, Jakab Tardos, Navid Nouri, Aidasadat Mousavifar

In this paper, we resolve the complexity problem of spectral graph sparcification in dynamic streams up to polylogarithmic factors. Using a linear sketch we design a streaming algorithm that uses (O) over tilde (n) space, and with high probability, recover ...

ASSOC COMPUTING MACHINERY2020

Transcapacitances in EPFL HEMT Model

Jean-Michel Sallese, Farzan Jazaeri

In this article, we present a closed-form solution for transcapacitances in GaN HEMTs derived from a design-oriented charge-based model of the AlGaAs/GaAs- and AlGaN/GaN-based HEMTs that were recently proposed. The analytical expressions are based on the c ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

String Matching: Communication, Circuits, and Learning

Mika Tapani Göös

String matching is the problem of deciding whether a given n-bit string contains a given k-bit pattern. We study the complexity of this problem in three settings. - Communication complexity. For small k, we provide near-optimal upper and lower bounds on th ...

Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany2019

Adaptive Streaming in Interactive Multiview Video Systems

Pascal Frossard, Laura Toni, Xue Zhang, Yao Zhao

Multiview applications endow final users with the possibility to freely navigate within 3D scenes with minimum-delay. A real feeling of scene navigation is enabled by transmitting multiple high-quality camera views, which can be used to synthesize addition ...

2019

LoRa Symbol Error Rate Under Non-Aligned Interference

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Orion Afisiadis, Matthieu Cotting

In this work, we examine the performance of the LoRa chirp spread spectrum modulation in the presence of both additive white Gaussian noise and interference from another LoRa user. To this end, we extend an existing interference model to the more realistic ...

IEEE2019

Sampling sufficiency for determining hydraulic habitat diversity

Anton Schleiss, Walter Gostner, Mário Jorge Rodrigues Pereira Da Franca, Severin Stähly, Christopher Robinson

The geometry and hydrodynamics of river reaches are key ecohydraulic descriptors. Statistics of water depth and velocity measurements are usually taken as proxies for habitat suitability in rivers. However, little is known about the sufficiency of data to ...

2019

Stable Fractional Matchings

Aris Filos Ratsikas

We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...

ASSOC COMPUTING MACHINERY2019

Circuit complexity

Graph Chatbot

Chattez avec Graph Search

On the Error Rate of the LoRa Modulation With Interference

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Transcapacitances in EPFL HEMT Model

String Matching: Communication, Circuits, and Learning

Adaptive Streaming in Interactive Multiview Video Systems

LoRa Symbol Error Rate Under Non-Aligned Interference

Sampling sufficiency for determining hydraulic habitat diversity

Stable Fractional Matchings

Stable Fractional Matchings

On the complexity of linearizability

Transcapacitances in EPFL HEMT Model

String Matching: Communication, Circuits, and Learning

On the complexity of linearizability

Stable Fractional Matchings

Adaptive Streaming in Interactive Multiview Video Systems

Stable Fractional Matchings

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

On the Error Rate of the LoRa Modulation With Interference

LoRa Symbol Error Rate Under Non-Aligned Interference

Sampling sufficiency for determining hydraulic habitat diversity