Concept

Couplage (théorie des graphes)

Publications associées (189)

Minimizing Human Effort in Reconciling Match Networks

Karl Aberer, Quoc Viet Hung Nguyen, Zoltán Miklós, Tri Kurniawan Wijaya

Schema and ontology matching is a process of establishing correspondences between schema attributes and ontology concepts, for the purpose of data integration. Various commercial and academic tools have been developed to support this task. These tools prov ...

2013

d-Transversals of stable sets and vertex covers in weighted bipartite graphs

Dominique de Werra, Bernard Ries

Let G=(V,E)G=(V,E) be a graph in which every vertex v∈Vv∈V has a weight w(v)⩾0w(v)⩾0 and a cost c(v)⩾0c(v)⩾0. Let SGSG be the family of all maximum-weight stable sets in G . For any integer d⩾0d⩾0, a minimum d-transversal in the graph G with respect to SGS ...

2012

Microsimulation framework for urban price-taker markets

Bilal Farooq

In the context of integrated transportation and other urban engineering infrastructure systems, there are many examples of markets, where consumers exhibit price-taking behaviour. While this behaviour is ubiquitous, the underlying mechanism can be captured ...

2012

Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games

Yannick Rochat

By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of uni ...

Public Library of Science2012

Intersection Patterns of Edges in Topological Graphs

Radoslav Fulek

This thesis is devoted to crossing patterns of edges in topological graphs. We consider the following four problems: A thrackle is a graph drawn in the plane such that every pair of edges meet exactly once: either at a common endpoint or in a proper crossi ...

EPFL2012

Embedding cylinder quality measures into Minutia Cylinder-Code based latent fingerprint matching

Andrzej Drygajlo, Mohammad Hamed Izadi

One of the major problems concerning latent fingerprint matching in forensic applications is the poor quality of fingerprint data. Therefore, local quality assessment of fingerprint images is necessary to ensure high biometric performance in this applicati ...

ACM Press2012

LDAHash: Improved Matching with Smaller Descriptors

Pascal Fua, Christoph Strecha

SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to ...

Institute of Electrical and Electronics Engineers2012

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal ...

2012

3-D Head Tracking via Invariant Keypoint Learning

Haoqi Wang, Vincent Lepetit

Keypoint matching is a standard tool to solve the correspondence problem in vision applications. However, in 3-D face tracking, this approach is often deficient because the human face complexities, together with its rich viewpoint, nonrigid expression, and ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Variabilité temporelle des rejets d'antibiotiques dans l'environnement: évaluation du risque pour la région lausannoise

Yves Bonnefin

Ce travail porte sur l’étude des variations temporelles des concentrations d’antibiotiques souvent observées dans les eaux de surface dans la littérature. Neuf substances sont étudiées en détail : azithromycine, ciprofloxacine, clarithromycine, clindamycin ...

2011

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