Publications associées à P (complexité)

Succinct ordering and aggregation constraints in algebraic array theories

We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...

Elsevier Science Inc2024

A mmWave Low Complexity and Low-Cost Super Wideband Dual-Polarized Aperture Coupled Antenna for 5G Applications

Anja Skrivervik, Abolfazl Azari

Advanced antenna system (AAS) is a viable option for 5G millimeter-wave (mmWave) applications. AAS single element is favored to be dual-polarized, wideband, high gain, and compact in order to be utilized for 5G antenna arrays. In this paper, a low complexi ...

Ieee-Inst Electrical Electronics Engineers Inc2024

On the selection and effectiveness of pseudo-absences for species distribution modeling with deep learning

Devis Tuia, Nina Marion Aurélia Van Tiel, Benjamin Alexander Kellenberger, Robin Adrien Zbinden, Lloyd Haydn Hughes

Species distribution modeling is a highly versatile tool for understanding the intricate relationship between environmental conditions and species occurrences. However, the available data often lacks information on confirmed species absence and is limited ...

2024

Scalable angular spectrum propagation

Felix Wechsler

Coherent field propagation is an essential computational tool in optics with applications ranging from computational optics and optical design to iterative field reconstructions. An improvement in the computational speed of current propagation methods is t ...

Optica Publishing Group2023

Distributionally Robust Linear Quadratic Control

Daniel Kuhn, Bahar Taskesen, Cagil Kocyigit

Linear-Quadratic-Gaussian (LQG) control is a fundamental control paradigm that is studied in various fields such as engineering, computer science, economics, and neuroscience. It involves controlling a system with linear dynamics and imperfect observations ...

2023

Exploring the effectiveness of using internal CNC system signals for chatter detection in milling process

Dimitrios Kyritsis, Xiaochen Zheng, Roberto Pérez

Chatter is a harmful self-excited vibration that commonly occurs during milling processes. Data -driven chatter detection and prediction is critical to achieve high surface quality and process efficiency. Most existing chatter detection approaches are base ...

ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD2023

A Low-Complexity LoRa Synchronization Algorithm Robust to Sampling Time Offsets

Orion Afisiadis, Mathieu Pierre Xhonneux

LoRaWAN is nowadays one of the most popular protocols for low-power Internet of Things communications. Although its physical layer, namely LoRa, has been thoroughly studied in the literature, aspects related to the synchronization of LoRa receivers have re ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Fast and accurate decoding of finger movements from ECoG through Riemannian features and modern machine learning techniques

Mahsa Shoaran, Bingzhao Zhu

Objective. Accurate decoding of individual finger movements is crucial for advanced prosthetic control. In this work, we introduce the use of Riemannian-space features and temporal dynamics of electrocorticography (ECoG) signal combined with modern machine ...

IOP Publishing Ltd2022

Time Dependent Image Generation of Plants from Incomplete Sequences with CNN-Transformer

Marc Conrad Russwurm

Data imputation of incomplete image sequences is an essential prerequisite for analyzing and monitoring all development stages of plants in precision agriculture. For this purpose, we propose a conditional Wasserstein generative adversarial network TransGr ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

Approximate Zero-Crossing: A new interpretable, highly discriminative and low-complexity feature for EEG and iEEG seizure detection

David Atienza Alonso, Tomas Teijeiro Campo, Una Pale, Renato Zanetti

Objective: Long-term monitoring of people with epilepsy based on electroencephalography (EEG) and intracranial EEG (iEEG) has the potential to deliver key clinical information for personalised epilepsy treatment. More specifically, in outpatient settings, ...

2022

OSLO: On-the-Sphere Learning for Omnidirectional Images and Its Application to 360-Degree Image Compression

Pascal Frossard, Thomas Maugey, Roberto Gerson De Albuquerque Azevedo

State-of-the-art 2D image compression schemes rely on the power of convolutional neural networks (CNNs). Although CNNs offer promising perspectives for 2D image compression, extending such models to omnidirectional images is not straightforward. First, omn ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Discrete Optimal Transport with Independent Marginals is #P-Hard

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

2023

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Alice Cortinovis

In this thesis we propose and analyze algorithms for some numerical linear algebra tasks: finding low-rank approximations of matrices, computing matrix functions, and estimating the trace of matrices. In the first part, we consider algorithms for building ...

EPFL2022

Hardware and Software Interfaces Design for Multi-Panel Electrochemical Sensors

Mandresy Ivan Ny Hanitra

The exponential growth of wearable healthcare devices market is fostered by the internetof- things (IoT) era. Connected smart biosensors enable a decentralized healthcare that does not constrain the user to be in a medical facility to get a real-time insig ...

EPFL2021

Privacy-Preserving Federated Analytics using Multiparty Homomorphic Encryption

David Jules Froelicher

Analyzing and processing data that are siloed and dispersed among multiple distrustful stakeholders is difficult and can even become impossible when the data are sensitive or confidential. Current data-protection and privacy regulations highly restrict the ...

EPFL2021

Tree in Tree: from Decision trees to Decision Graphs

Mahsa Shoaran, Bingzhao Zhu

Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framework that extends the conventional dec ...

Curran Associates, Inc, (NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems)2021

Knapsack and Subset Sum with Small Items

Adam Teodor Polak, Lars Rohwedder

Knapsack and Subset Sum are fundamental NP-hard problems in combinatorial optimization. Recently there has been a growing interest in understanding the best possible pseudopolynomial running times for these problems with respect to various parameters. In t ...

Schloss Dagstuhl -- Leibniz-Zentrum für Informatik2021

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Mikhail Kapralov, Jakab Tardos

Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new applicati ...

ASSOC COMPUTING MACHINERY2021

Scalable and Efficient Comparison-based Search without Features

Matthias Grossglauser, Lucas Maystre, Daniyar Chumbalov

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generate ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

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