Quantitative estimate on singularities in isoperimetric clusters
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.
One of the shortcomings of the existing clustering methods is their problems dealing with different shape and size clusters. On the other hand, most of these methods are designed for especial cluster types or have good performance dealing with particular s ...
This work presents document clustering experiments performed over noisy texts (i.e. text that have been extracted through an automatic process like speech or character recognition). The effect of recognition errors on different clustering techniques is mea ...
When performing regression with piecewise affine maps, the most challenging task is to classify the data points, i.e. to correctly attribute a data point to the affine submodel that most likely generated it. In this paper, we consider a regression scheme s ...
This work addresses the problem of reducing the time between query submission and results output in a retrieval system. The goal is achieved by considering only a database fraction as small as possible during the retrieval process. Our approach is based on ...
The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often self-organize in user communities through Flickr Groups. These groups are part ...
We propose a simple information-theoretic clustering approach based on maximizing the mutual information I(\sfx,y) between the unknown cluster labels y and the training patterns \sfx with respect to parameters of specifically constrained encoding dis ...
The extension of the likelihood method of Süveges (Extremes, 2007) is presented. The extension allows for finding independent clusters of extreme events and determining the range of dependence on extremal levels, and estimate clustering characteristic of t ...
In this paper we propose to use clustering methods for automatic counting of pedestrians in video sequences. As input, we consider the output of those detection/ tracking systems that overestimate the number of targets. Clustering techniques are applied to ...
The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often self-organize in user communities through Flickr Groups. These groups are pa ...
We derive inverse trace inequalities for hp-finite elements. Utilizing orthogonal polynomials, we show how to derive explicit expressions for the constants when considering triangular and tetrahedral elements. We also discuss how to generalize this techniq ...
