Publication

Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks

Related publications (113)

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.

Flickr Hypergroups

Daniel Gatica-Perez, Radu Andrei Negoescu

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

2009

Flickr Hypergroups

Daniel Gatica-Perez, Radu Andrei Negoescu

Idiap2009

On Clustering Phenomenon in Mobile Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

According to different kinds of connectivity, we can distinguish three types of mobile ad-hoc networks: dense, sparse and clustered networks. This paper is about modeling mobility in clustered networks, where nodes are concentrated into clusters of dense c ...

ACM2008

SOM-based Clustering of Multilingual Documents Using an Ontology

Minh Hai Pham

Clustering similar documents is a difficult task for text data mining. Difficulties stem especially from the way documents are translated into numerical vectors. In this chapter, we will present a method that uses Self Organizing Map (SOM) to cluster medic ...

Information Science Reference2008

Learning Cluster Type and Dissimilarity Metric for Each Cluster Using a Set of Possible Cluster Types

Arash Arami

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

2007

Simplifying complex networks

David Gfeller

The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...

EPFL2007

Likelihood estimation of the extremal index

Mária Süveges

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

2007

Short-Term Spatio-Temporal Clustering Applied to Multiple Moving Speakers

Jean-Marc Odobez, Guillaume Lathoud

Distant microphones permit to process spontaneous multi-party speech with very little constraints on speakers, as opposed to close-talking microphones. Minimizing the constraints on speakers permits a large diversity of applications, including meeting summ ...

2007

Counting pedestrians in video sequences using trajectory clustering

Jean-Philippe Thiran, Gianluca Antonini

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

2006

Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems

Anne-Marie Kermarrec, Sidath Handurukande

In this paper we present an empirical study of a workload gathered by crawling the eDonkey network - a dominant peer-to-peer file sharing system - for over 50 days. We first confirm the presence of some known features, in particular the prevalence of free- ...

2006