Concept

Binomial series

Related publications (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 Ns

\mathbb {N}s

-graded algebra A

A

, we define and study its volume function FA:N+s -> R

F_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

The L-1-Potts Functional For Robust Jump-Sparse Reconstruction

Martin Kurt Storath

We investigate the nonsmooth and nonconvex L-1-Potts functional in discrete and continuous time. We show Gamma-convergence of discrete L-1-Potts functionals toward their continuous counterpart and obtain a convergence statement for the corresponding minimi ...

Siam Publications2015

Factorization of quantum charge transport for noninteracting fermions

Dmitri Ivanov

We show that the statistics of the charge transfer of noninteracting fermions through a two-lead contact is generalized binomial at any temperature and for any form of the scattering matrix: an arbitrary charge-transfer process can be decomposed into indep ...

2009

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

Domain decomposition methods for the coupling of surface and groundwater flows

Marco Discacciati

The purpose of this thesis is to investigate, from both the mathematical and numerical viewpoint, the coupling of surface and porous media flows, with particular concern on environmental applications. Domain decomposition methods are applied to set up effe ...

EPFL2004

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

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.