Concept

Surjection

Publications associées (12)

Birational characterization of abelian varieties and ordinary abelian varieties in characteristic p>0

Let k be an algebraically closed field of characteristic p > 0. We give a birational characterization of ordinary abelian varieties over k: a smooth projective variety X is birational to an ordinary abelian variety if and only if kappa(S)(X) = 0 and b(1)(X ...

DUKE UNIV PRESS2019

On subadditivity of Kodaira dimension in positive characteristic over a general type base

Zsolt Patakfalvi

We show that for a surjective, separable morphism f of smooth projective varieties over a field of positive characteristic such that f(*) OX congruent to O-Y subadditivity of Kodaira dimension holds, provided the base is of general type and the Hasse-Witt ...

2018

The melanization reaction in Drosophila: More than black or white

Jan Paul Dudzic

The melanization reaction is a rapid and important immune mechanism in arthropods. It results in the production of melanin at the site of injury and around invading microbes. The enzymes responsible for melanogenesis are phenoloxidases (PO), which catalyze ...

EPFL2018

Endo-trivial modules: a reduction to p'-central extensions

Jacques Thévenaz, Caroline Lassueur

We examine how, in prime characteristic p, the group of endotrivial modules of a finite group G and the group of endotrivial modules of a quotient of G modulo a normal subgroup of order prime to p are related. There is always an inflation map, but examples ...

2017

Method, System and Device for Direct Prediction of 3D Body Poses from Motion Compensated Sequence

Pascal Fua, Vincent Lepetit, Bugra Tekin, Artem Rozantsev

A method for predicting three-dimensional body poses from image sequences of an object, the method performed on a processor of a computer having memory, the method including the steps of accessing the image sequences from the memory, finding bounding boxes ...

2017

Specialising Parsers for Queries

Manohar Jonnalagedda

Many software systems consist of data processing components that analyse large datasets to gather information and learn from these. Often, only part of the data is relevant for analysis. Data processing systems contain an initial preprocessing step that fi ...

EPFL2016

Carrier Mobility Extraction Methodology in Junctionless and Inversion-Mode FETs

Jean-Michel Sallese, Farzan Jazaeri

In this paper, we propose a new method to extract the free carrier mobility in junctionless (JL) double-gate FETs biased in accumulation. We show that, in addition to assuming a well-defined field-dependent mobility law, using the well-known Y-function is ...

Institute of Electrical and Electronics Engineers2015

High-contrast Computational Caustic Design

Mark Pauly, Andrea Tagliasacchi, Yuliy Gennadievich Schwartzburg, Romain Pierre Testuz

We present a new algorithm for computational caustic design. Our algorithm solves for the shape of a transparent object such that the refracted light paints a desired caustic image on a receiver screen. We introduce an optimal transport formulation to esta ...

ACM2014

On ANOVA expansions and strategies for choosing the anchor point

Jan Sickmann Hesthaven, Zhen Gao

The classic Lebesgue ANOVA expansion offers an elegant way to represent functions that depend on a high-dimensional set of parameters and it often enables a substantial reduction in the evaluation cost of such functions once the ANOVA representation is con ...

Elsevier2010

Super-resolution fluorescence microscopy based on physical models

François Aguet

This thesis introduces a collection of physics-based methods for super-resolution in optical microscopy. The core of these methods constitutes a framework for 3-D localization of single fluorescent molecules. Localization is formulated as a parameter estim ...

EPFL2009

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