Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Vecteur unitaire

Publications associées (25)

Randomized flexible GMRES with deflated restarting

Laura Grigori

For a high-dimensional problem, a randomized Gram-Schmidt (RGS) algorithm is beneficial in terms of both computational cost and numerical stability. We apply this dimension reduction technique by random sketching to Krylov subspace methods, e.g., to the ge ...

Springer2024

Efficient Temporally-Aware DeepFake Detection using H.264 Motion Vectors

Sabine Süsstrunk, Yufan Ren, Peter Arpad Grönquist

Video DeepFakes are fake media created with Deep Learning (DL) that manipulate a person’s expression or identity. Most current DeepFake detection methods analyze each frame independently, ignoring inconsistencies and unnatural movements between frames. Som ...

2024

Short homology bases for hyperelliptic hyperbolic surfaces

Jürgpeter Buser

Given a hyperelliptic hyperbolic surface S of genus g >= 2, we find bounds on the lengths of homologically independent loops on S. As a consequence, we show that for any lambda is an element of (0, 1) there exists a constant N(lambda) such that every such ...

Hebrew Univ Magnes Press2023

Aryl-ether-free polyaromatic polymers with branched structures for anion exchange membranes

Xile Hu, Xingyu Wu

The present invention relates to a polyaromatic polymer that comprises multifunctional aromatic moieties MA, cationic groups CG and bifunctional aromatic moieties BA, wherein one or more CG and one or more BA form a linear unit L, and MA is connected to 3 ...

2023

Dynamical Low-Rank Approximation for Stochastic Differential Equations

Fabio Nobile, Yoshihito Kazashi, Fabio Zoccolan

In this paper, we set the mathematical foundations of the Dynamical Low-Rank Approximation (DLRA) method for stochastic differential equations (SDEs). DLRA aims at approximating the solution as a linear combination of a small number of basis vectors with r ...

American Mathematical Society (AMS)2025

Get the Best of Both Worlds: Improving Accuracy and Transferability by Grassmann Class Representation

Haoqi Wang

We generalize the class vectors found in neural networks to linear subspaces (i.e., points in the Grassmann manifold) and show that the Grassmann Class Representation (GCR) enables simultaneous improvement in accuracy and feature transferability. In GCR, e ...

Ieee Computer Soc2023

Traversing Time Dependent Light Fields for Daylight Glare Evaluation

Stephen William Wasilewski

To understand how daylight gives shape and life to architectural spaces, whether existing or imagined, requires quantifying its dynamism and energy. Maintaining these details presents a challenge to simulation and analysis methods that flatten data into di ...

EPFL2023

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

Tommaso Vanzan

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

2022

Learning V1 Simple Cells with Vector Representation of Local Content and Matrix Representation of Local Motion

Yufan Ren

This paper proposes a representational model for image pairs such as consecutive video frames that are related by local pixel displacements, in the hope that the model may shed light on motion perception in primary visual cortex (V1). The model couples the ...

ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2022

TimeEvolver: A program for time evolution with improved error bound

Sebastian Zell

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

ELSEVIER2022

Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault, Le Nguyen Hoang, Arsany Hany Abdelmessih Guirguis, Sadegh Farhadkhani

We study Byzantine collaborative learning, where n nodes seek to collectively learn from each others' local data. The data distribution may vary from one node to another. No node is trusted, and f < n nodes can behave arbitrarily. We prove that collaborati ...

2021

Further results on latent discourse models and word embeddings

Youssef Allouah

We discuss some properties of generative models for word embeddings. Namely, (Arora et al., 2016) proposed a latent discourse model implying the concentration of the partition function of the word vectors. This concentration phenomenon led to an asymptotic ...

Microtome Publishing2021

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

Christopher Brandt

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 ...

2020

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

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

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

Mingkui Wang, Olivier Schneider, Chao Wang, Yiming Li, Sun Hee Kim, Ke Huang

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 ...

American Physical Society2019

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

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