Concept

Méthode des k plus proches voisins

Publications associées (233)

Hardware Implementation of Neural Self-Interference Cancellation

Andreas Peter Burg, Alexios Konstantinos Balatsoukas Stimming, Andreas Toftegaard Kristensen, Yann Kurzo

In-band full-duplex systems can transmit and receive information simultaneously and on the same frequency band. However, due to the strong self-interference caused by the transmitter to its own receiver, the use of non-linear digital self-interference canc ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Kagome model for a Z(2) quantum spin liquid

Jonathan D'Emidio

We present a study of a simple model antiferromagnet consisting of a sum of nearest-neighbor SO(N) singlet projectors on the kagome lattice. Our model shares some features with the popular S = 1/2 kagome antiferromagnet but is specifically designed to be f ...

AMER PHYSICAL SOC2020

SwarmLab: a MATLAB Drone Swarm Simulator

Dario Floreano, Fabrizio Schiano, Enrica Soria

Among the available solutions for drone swarm simulations, we identified a lack of simulation frameworks that allow easy algorithms prototyping, tuning, debugging and performance analysis. Moreover, users who want to dive in the research field of drone swa ...

2020

Can Your Face Detector Do Anti-spoofing? Face Presentation Attack Detection with a Multi-Channel Face Detector

Sébastien Marcel

In a typical face recognition pipeline, the task ofthe face detector is to localize the face region. However, the facedetector localizes regions that look like a face, irrespective of theliveliness of the face, which makes the entire system susceptible to ...

Idiap2020

Continuous monitoring of propofol in human serum with fouling compensation by support vector classifier

Giovanni De Micheli, Sandro Carrara, Mandresy Ivan Ny Hanitra, Danilo Demarchi, Francesca Criscuolo, Simone Aiassa, Francesco Grassi, Tiberiu Totu, Gabriele Sandri

We present a new method for electrochemical sensing, which compensates the fouling effect of propofol through machine learning (ML) model. Direct and continuous monitoring of propofol is crucial in the development of automatic systems for control of drug i ...

2020

Fingerprinting Big Data: The Case of KNN Graph Construction

Rachid Guerraoui, Anne-Marie Kermarrec, Olivier Ruas

We propose fingerprinting, a new technique that consists in constructing compact, fast-to-compute and privacy-preserving binary representations of datasets. We illustrate the effectiveness of our approach on the emblematic big data problem of K-Nearest-Nei ...

2019

Exploring The Borderlands Of The Gathering Problem

Rachid Guerraoui, El Mahdi El Mhamdi, Alexandre David Olivier Maurer, Vladislav Tempez

Problems of pattern formation have been extensively studied in distributed computing. One of this problems is the gathering problem: agents must gather at a same position in a distributed manner. When gathering is not possible, a close problem is the conve ...

2019

Covering convex bodies and the Closest Vector Problem

Moritz Andreas Venzin, Márton Naszódi

We present faster algorithms for the approximate Closest Vector Problem under l_p norms ...

2019

On the Impact of Uncertainty for Path Planning

We consider the problem of planning paths on graphs with some edges whose traversability is uncertain; for each uncertain edge, we are given a probability of being traversable (e.g., by a learned classifier). We categorize different interpretations of the ...

2019

Determination and evaluation of the nonadditivity in wetting of molecularly heterogeneous surfaces

Francesco Stellacci, Michele Ceriotti, Sylvie Roke, Quy Ong Khac, Halil Ibrahim Okur, David Mark Wilkins, Zhi Luo, Anna Murello, Filip Kovacik

The interface between water and folded proteins is very complex. Proteins have "patchy" solvent-accessible areas composed of domains of varying hydrophobicity. The textbook understanding is that these domains contribute additively to interfacial properties ...

PNAS2019

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search