Publications associées (9)

Multigraded algebras and multigraded linear series

Leonid Monin, Fatemeh Mohammadi, Yairon Cid Ruiz

This paper is devoted to the study of multigraded algebras and multigraded linear series. For an NsNs\mathbb {N}s-graded algebra AAA, we define and study its volume function FA:N+s -> RFA:N+sRF_A:\mathbb {N}_+s\rightarrow \mathbb {R}, which computes the ...
Wiley2024

Discrimination of numerical proportions: A comparison of binomial and Gaussian models

Aire Raidvee

Observers discriminated the numerical proportion of two sets of elements (N = 9, 13, 33, and 65) that differed either by color or orientation. According to the standard Thurstonian approach, the accuracy of proportion discrimination is determined by irredu ...
Springer2017

Excess-Risk of Distributed Stochastic Learners

Ali H. Sayed

This paper studies the learning ability of consensus and diffusion distributed learners from continuous streams of data arising from different but related statistical distributions. Four distinctive features for diffusion learners are revealed in relation ...
IEEE2016

Fibonacci Heaps

Ali Chekir, Mohamed Slim Slama

Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...
2006

Hard equality constrained integer knapsacks

Arjen Lenstra

We consider the following integer feasibility problem: Given positive integer numbers a0, a1,&mellip;,an with gcd(a1,&mellip;,an) = 1 and a = (a1,&mellip;,an), does there exist a ...
2004

Geometrical and mathematical aspects of the adiabatic theorem of quantum mechanics

This work is devoted to rigorous results about the adiabatic theorem of quantum mechanics. This theorem deals with the time dependent Schrödinger equation when the hamiltonian is a slowly varying function of time, characterizing the so-called adiabatic reg ...
EPFL1992

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.