Publication

Towards large scale multimedia indexing: A case study on person discovery in broadcast news

Related publications (47)

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.

Analysis of the Limits of Graph-Based Object Duplicate Detection

Touradj Ebrahimi, Lutz Goldmann, Péter Vajda

In this paper, we consider the evaluation of graph-based object duplicate detection. Several applications require accurate and efficient object duplicate detection methods, such as automatic video and image tag propagation, video surveillance, and high lev ...

2009

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

Drawing cubic graphs with at most five slopes

János Pach, Balázs Keszegh

We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice. ...

2008

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

Mining Co-Change Clusters from Version Repositories

Dirk Thilo Beyer

Clusters of software artifacts that are frequently changed together are subsystem candidates, because one of the main goals of software design is to make changes local. The contribution of this paper is a visualization-based method that supports the identi ...

2005

Making Retrieval Faster Through Document Clustering

David Grangier, Alessandro Vinciarelli

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

IDIAP2004