Quantitative estimate on singularities in isoperimetric clusters
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.
We address the problem of minimizing a smooth function f0(x) over a compact set D defined by smooth functional constraints fi(x)≤0, i=1,…,m given noisy value measurements of fi(x). This problem arises in safety-critical applications, where certain paramete ...
The problem of clustering in urban traffic networks has been mainly studied in static framework by considering traffic conditions at a given time. Nevertheless, it is important to underline that traffic is a strongly time-variant process and it needs to be ...
We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...
The system and method for used capsules (11), such as coffee capsules, with a lid and a capsule body, comprises at least cutting means (17) to cut the lid from the body, capturing means to extract the cut lid from the body, compacting means (12, 14) to com ...
Introduced 50 years ago by David Kazhdan, Kazhdan's Property (T) has quickly become an active research area in mathematics, with a lot of important results. A few years later, this property has been generalized to discrete group actions by Robert J. Zimmer ...
The problem of clustering in urban traffic networks has been mainly studied in static framework by considering traffic conditions at a given time. Nevertheless, it is important to underline that traffic is a strongly time-variant process and it needs to be ...
Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...
The rapid growth of multimedia databases and the human interest in their peers make indices representing the location and identity of people in audio-visual documents essential for searching archives. Person discovery in the absence of prior identity knowl ...
The present work concerns the approximation of the solution map S associated to the parametric Helmholtz boundary value problem, i.e., the map which associates to each (real) wavenumber belonging to a given interval of interest the corresponding solution o ...
A Poisson process P-lambda on R-d with causal structure inherited from the the usual Minkowski metric on R-d has a normalised discrete causal distance D-lambda (x, y) given by the height of the longest causal chain normalised by lambda(1/d)c(d). We prove t ...
