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

Concept

Linkless embedding

Publications associées (27)

Generalized Turan problems for disjoint copies of graphs

Abhishek Methuku

Given two graphs H and F, the maximum possible number of copies of H in an F-free graph on n vertices is denoted by ex(n, H, F). We investigate the function ex(n, H, kF), where kF denotes k vertex disjoint copies of a fixed graph F. Our results include cas ...

Elsevier2019

Open-Vocabulary Keyword Spotting with Audio and Text Embeddings

Martin Jaggi

Keyword Spotting (KWS) systems allow detecting a set of spoken (pre-defined) keywords. Open-vocabulary KWS systems search for the keywords in the set of word hypotheses generated by an automatic speech recognition (ASR) system which is computationally expe ...

2019

Every Smile is Unique: Landmark-Guided Diverse Smile Generation

Pascal Fua, Wei Wang

Each smile is unique: one person surely smiles in different ways (e.g. closing/opening the eyes or mouth). Given one input image of a neutral face, can we generate multiple smile videos with distinctive characteristics? To tackle this one-to-many video gen ...

IEEE2018

On chirality of toroidal embeddings of polyhedral graphs

Senja Dominique Barthel

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a non-split link due to [2, 3]. Building on this and using the chirality of torus knots and ...

World Scientific Publishing2017

Irreducible network backbones: unbiased graph filtering via maximum entropy

Alessio Vincenzo Cardillo

Networks provide an informative, yet non-redundant description of complex systems only if links represent truly dyadic relationships that cannot be directly traced back to node-specific properties such as size, importance, or coordinates in some embedding ...

2017

Many disjoint edges in topological graphs

Andres Jacinto Ruiz Vargas

A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most one ...

Elsevier Science Bv2017

Fourier dimensionality reduction of radio-interferometric data

Jean-Philippe Thiran, Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

Next-generation radio-interferometers face a computing challenge with respect to the imaging techniques that can be applied in the big data setting in which they are designed. Dimensionality reduction can thus provide essential savings of computing resourc ...

2017

Publications associées (27)