Sublinear Algorithms for Spectral Graph Clustering
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.
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 ...
In many signal such speech, bio-signals, protein chains, etc. there is a dependency between consecutive vectors. As the dependency is limited in duration such data can be called as Piecewise-Dependent- Data (PDD). In clustering it is frequently needed to m ...
In this paper, we present a novel speaker segmentation and clustering algorithm. The algorithm automatically performs both speaker segmentation and clustering without any prior knowledge of the identities or the number of speakers. Advantages of this algor ...
Equilibrium geometries and electronic properties of neutral and anionic Cu-n (n = 2, 10) clusters are determined via first-principles calculations which treat s and d electrons on an equal footing. We find cluster shapes similar to those reported in the li ...
In this paper, we present a novel speaker segmentation and clustering algorithm. The algorithm automatically performs both speaker segmentation and clustering without any prior knowledge of the identities or the number of speakers. Advantages of this algor ...
In many signal such speech, bio-signals, protein chains, etc. there is a dependency between consecutive vectors. As the dependency is limited in duration such data can be called as Piecewise-Dependent- Data (PDD). In clustering it is frequently needed to m ...
IDIAP and Ben-Gurion University of the Negev, Israel2002
In this paper we focus on the identification of discrete-time hybrid systems in the Piece-Wise Affine (PWA) form. This problem can be formulated as the reconstruction of a possibly discontinuous PWA map with a multi-dimensional domain. In order to achieve ...
The purpose of this report is to present the study of a linguistic network based on the relation of synonymy. The network has been extracted from a dictionary of synonyms in French. Due to errors and ambiguities in the data, the synonyms are not always gro ...
We propose a new technique for the identification of discrete-time hybrid systems in the Piece-Wise Affine (PWA) form. The identification algorithm proposed in (Ferrari-Trecate et. al., 2000) is first considered and then improved under various aspects. Mea ...
Video structuring aims at automatically finding structure in a video sequence. Occupying a key-position within video analysis, it is a fundamental step for quality indexing and browsing. As a low level video analysis, video structuring can be seen as a ser ...
