Publication

Clustering via diffusion adaptation over networks

Publications associées (57)

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

Analysis of a Synonymy Network

Paolo De Los Rios, Jean-Cédric Chappelier, David Gfeller

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 ...

2004

The SWARM-BOTS project

Dario Floreano, Francesco Mondada, Roderich Gross, Jean-Louis Deneubourg, Luca Maria Gambardella

This paper provides an overview of the SWARM-BOTS project, a robotic project sponsored by the Future and Emerging Technologies program of the European Community (IST-2000-31010). The paper illustrates the robot hardware, and the results of experimental wor ...

Springer Verlag2004

OnCall: defeating spikes with a free-market application cluster

George Candea

Even with reasonable overprovisioning, today's Internet application clusters are unable to handle major traffic spikes and flash crowds. As an alternative to fixed-size, dedicated clusters, we propose a dynamically-shared application cluster model based on ...

2004

Finding Structure in Home Videos by Probabilistic Hierarchical Clustering

Daniel Gatica-Perez

Accessing, organizing, and manipulating home videos present technical challenges due to their unrestricted content and lack of storyline. In this paper, we present a methodology to discover cluster structure in home videos, which uses video shots as the un ...

2003

On Optimal Update Policies and Cluster Sizes for 2-Tier Distributed Systems

Anwitaman Datta, Prasenjit Dey

We try to analyze a generic model for 2-tier distributed systems, exploring the possibility of optimal cluster sizes from an information management perspective, such that the overall cost for updating and searching information may be minimized by adopting ...

2003

Unknown-Multiple Speaker clustering using HMM

Hervé Bourlard, Jitendra Ajmera

An HMM-based speaker clustering framework is presented, where the number of speakers and segmentation boundaries are unknown \emph{a priori}. Ideally, the system aims to create one pure cluster for each speaker. The HMM is ergodic in nature with a minimum ...

2002

Unknown-Multiple Speaker clustering using HMM

Hervé Bourlard, Jitendra Ajmera

IDIAP2002

Finding Structure in Consumer Videos by Probabilistic Hierarchical Clustering

Daniel Gatica-Perez

IDIAP2002

Language modeling based on neural clustering of words

This document describes a neural method for clustering words and its use in language modeling for speech recognizers. The method is based on clustering the words which appear on similar local context and estimating the parameters needed for language modeli ...

IDIAP2000

Isopulegol as a model compound. Metalation and substitution of an allylic position in the presence of an unprotected hydroxy function

When treated with BuLi and KOCMe3 for 2 h at 0 Deg in hexane, the unsatd. monoterpenic alc. isopulegol is simultaneously deprotonated at the hydroxy function and the allylic Me group. The metaloxy allylmetal species thus generated can be silylated, alkylat ...

1999