Concept

Vecteur unitaire

Publications associées (80)

Locally supported tangential vector, n-vector, and tensor fields

We introduce a construction of subspaces of the spaces of tangential vector, n-vector, and tensor fields on surfaces. The resulting subspaces can be used as the basis of fast approximation algorithms for design and processing problems that involve tangenti ...

WILEY2020

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

Rapid Analysis of Arbitrary-Shaped Conformal Beam-Scanning Arrays

Anja Skrivervik, Denys Nikolayev

Conformal antenna arrays are able to fit seamlessly on curved 3D-shaped surfaces, which are found ubiquitously on vehicles, aircraft, a human body, etc. In addition, conformal structures can overcome the scan loss limitations of conventional planar arrays. ...

IEEE2020

Damage mitigation of a near-full-scale deployable tensegrity structure through behavior biomimetics

Ian Smith, Ann Christine Sychterz

Current infrastructure is designed and built such that it must simultaneously comply with all possible loads. This leads to overdesigned structures that are inefficient in terms energy and cost. A structure that can self-identify damage, adapt, and learn f ...

2019

Observation of tau(-) -> pi(-)nu(tau)e(+)e(-) and search for tau(-) -> pi(-)nu(tau)mu(+)mu(-)

Olivier Schneider, Yiming Li, Mingkui Wang, Chao Wang, Tagir Aushev, Sun Hee Kim, Ke Huang, Donghyun Kim, Lei Li

We present the first measurements of branching fractions of rare tau-lepton decays, tau(-) -> pi(-)nu(tau)l(+)l(-) (l = e or mu), using a data sample corresponding to 562 fb(-1) collected at a center-of-mass energy of 10.58 GeV with the Belle detector at t ...

AMER PHYSICAL SOC2019

Trustworthy speaker recognition with minimal prior knowledge using neural networks

Hannah Muckenhirn

The performance of speaker recognition systems has considerably improved in the last decade. This is mainly due to the development of Gaussian mixture model-based systems and in particular to the use of i-vectors. These systems handle relatively well noise ...

EPFL2019

Low-latency speaker spotting with online diarization and detection

Sébastien Marcel, Nicholas Evans

This paper introduces a new task termed low-latency speaker spotting (LLSS). Related to security and intelligence applications, the task involves the detection, as soon as possible, of known speakers within multi-speaker audio streams. The paper describes ...

2018

Improved stability of optimal traffic paths

Maria Colombo

Models involving branched structures are employed to describe several supply-demand systems such as the structure of the nerves of a leaf, the system of roots of a tree, and the nervous or cardiovascular systems. Given a flow (traffic path) that transports ...

2018

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Method, system, and device for learned invariant feature transform for computer images

Pascal Fua, Vincent Lepetit, Kwang Moo Yi, Eduard Trulls Fortuny

A method for training a feature detector of an image processing device, including the steps of detecting features in the image to generate a score map, computing a center of mass on the score map to generate a location, extracting a patch from the image at ...

2018

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