Concept

Nombre cardinal

Publications associées (16)

HyperLogLog: Exponentially Bad in Adversarial Settings

Computing the count of distinct elements in large data sets is a common task but naive approaches are memory-expensive. The HyperLogLog (HLL) algorithm (Flajolet et al., 2007) estimates a data set's cardinality while using significantly less memory than a ...

IEEE COMPUTER SOC2022

Using Novel Molecular-Level Chemical Composition Observations of High Arctic Organic Aerosol for Predictions of Cloud Condensation Nuclei

Julia Schmale, Andrea Baccarini, Lubna Dada

Predictions of cloud droplet activation in the late summertime (September) central Arctic Ocean are made using κ-Köhler theory with novel observations of the aerosol chemical composition from a high-resolution time-of-flight chemical ionization mass spectr ...

2022

Reduced-order Models for Simulating Coupled Geometric Instabilities in Steel Beam-columns Under Inelastic Cyclic Straining

Alexander Riley Hartloper

Numerical models that can simulate coupled geometric instabilities in steel beam-columns are required for the seismic assessment of certain steel moment-resisting frames. Reliably simulating coupled instabilities requires that the steel material is precise ...

EPFL2021

Correspondence functors and finiteness conditions

Jacques Thévenaz, Serge Bouc

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties wh ...

2018

Small subset sums

Gergely Ambrus

Let parallel to.parallel to be a norm in R-d whose unit ball is B. Assume that V subset of B is a finite set of cardinality n, with Sigma(v is an element of V) v = 0. We show that for every integer k with 0

Elsevier Science Inc2016

The representation theory of finite sets and correspondences

Jacques Thévenaz, Serge Bouc

We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties which do not hold for other types of functor ...

2015

A synthesis of cloud condensation nuclei counter (CCNC) measurements within the EUCAARI network

Athanasios Nenes

Cloud condensation nuclei counter (CCNC) measurements performed at 14 locations around the world within the European Integrated project on Aerosol Cloud Climate and Air Quality interactions (EUCAARI) framework have been analysed and discussed with respect ...

Copernicus GmbH2015

On the topological full group of a minimal Cantor Z2-system

Nicolas Monod, Gábor Elek

Grigorchuk and Medynets recently announced that the topological full group of a minimal Cantor Z-action is amenable. They asked whether the statement holds for all minimal Cantor actions of general amenable groups as well. We answer in the negative by prod ...

2013

A reduced basis hybrid method for the coupling of parametrized domains represented by fluidic networks

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains wh ...

Elsevier2012

Minimum d-blockers and d-transversals in graphs

Dominique de Werra

We consider a set V of elements and an optimization problem on V: the search for a maximum (or minimum) cardinality subset of V verifying a given property a"similar to. A d-transversal is a subset of V which intersects any optimum solution in at least d el ...

2011

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