Concept

Base de données orientée graphe

Publications associées (517)

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

Properties of Network Polynomials

Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

Ieee2012

ConDense: Managing Data in Community-driven Mobile Geosensor Networks

Karl Aberer, Dipanjan Chakraborty, Saket Sathe, Sebastian Cartier

Effectively managing the data generated by community-driven mobile geo-sensor networks is a new and challenging problem. One important step for managing and querying sensor network data is to create abstractions of the data in the form of models. These mod ...

2012

Methods for Clustering Multi-Layer Graphs in Mobile Networks

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Clustering on graphs has been studied extensively for years due to its numerous applications. However, in contrast to the classic problems, clustering in mobile and online social networks brings new challenges. In these scenarios, it is common that observa ...

2011

A Large-Scale Database of Images and Captions for Automatic Face Naming

Barbara Caputo, Jie Luo, Vittorio Ferrari

We present a large scale database of images and captions, designed for supporting research on how to use captioned images from the Web for training visual classifiers. It consists of more than 125,000 images of celebrities from different fields downloaded ...

2011

A Large-Scale Database of Images and Captions for Automatic Face Naming

Barbara Caputo, Jie Luo, Vittorio Ferrari

Idiap2011

Space crossing numbers

We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs. ...

2011

Omnidirectional Object Duplicate Detection

Touradj Ebrahimi, Lutz Goldmann, Ivan Ivanov, Péter Vajda

In this paper, we extend a graph-based approach for omnidirectional object duplicate detection in still images. Objects are detected from several points of view with different distances. The goal of this work is to determine how many training images have t ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Content Preference Estimation In Online Social Networks: Message Passing Versus Sparse Reconstruction On Graphs

We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for which this information is available ahead of time. The techniques take advantag ...

2011

Object Duplicate Detection

Péter Vajda

With the technological evolution of digital acquisition and storage technologies, millions of images and video sequences are captured every day and shared in online services. One way of exploring this huge volume of images and videos is through searching a ...

EPFL2011

Conway's conjecture for monotone thrackles

János Pach

A drawing of a graph in the plane is called a thrackle if every pair of edges meet precisely once, either at a common vertex or at a proper crossing. According to Conway's conjecture, every thrackle has at most as many edges as vertices. We prove this conj ...

Mathematical Association of America2011