Concept

Graph embedding

Publications associées (121)

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

Non-Rigid Graph Registration using Active Testing Search

Pascal Fua, Raphael Sznitman, Jan Kybic, Miguel Amável Dos Santos Pinheiro

We present a new approach for matching sets of branching curvilinear structures that form graphs embedded in R2 or R3 and may be subject to deformations. Unlike earlier methods, ours does not rely on local appearance similarity nor does require a good init ...

Institute of Electrical and Electronics Engineers2015

Free Edge Lengths in Plane Graphs

Radoslav Fulek, Filip Moric

We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the "host" of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a pla ...

Springer2015

Codimension one stability of the catenoid under the vanishing mean curvature flow in Minkowski space

Joachim Krieger, Roland Donninger, Willie Wai Yeung Wong

We study time-like hypersurfaces with vanishing mean curvature in the (3+1) dimensional Minkowski space, which are the hyperbolic counterparts to minimal embeddings of Riemannian manifolds. The catenoid is a stationary solution of the associated Cauchy pro ...

Duke Univ Press2015

Mining, Modeling and Predicting Mobility

Mohamed Kafsi

Mobility is a central aspect of our life, and our movements reveal much more about us than simply our whereabouts. In this thesis, we are interested in mobility and study it from three different perspectives: the modeling perspective, the information-theor ...

EPFL2015

Reflective optical objective

Jürgen Brugger, Victor Javier Cadarso Busto, Davor Kosanic, Bastien Rachet

The present invention relates to a reflective optical objective (1) comprising: —a first reflecting element (3) including a front surface (3a) and a hack surface (3b), the front surface (3a) including a convex reflecting surface (11); and —a second reflect ...

2015

Discriminant Multi-Label Manifold Embedding for Facial Action Unit Detection

Jean-Philippe Thiran, Anil Yuce, Hua Gao

This article describes a system for participation in the Facial Expression Recognition and Analysis (FERA2015) sub-challenge for spontaneous action unit occurrence detection. The problem of AU detection is a multi-label classification problem by its nature ...

2015

Dimension embedding for big data in radio interferometry

Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

As radio telescope data is now increasingly high-dimensional, data reduction has become essential to reduce computational load while preserving accurate signal reconstruction. Gridding the continuous Fourier visibilities represents the standard approach to ...

2015

On grids in topological graphs

János Pach

A topological graph G is a graph drawn in the plane with vertices represented by points and edges represented by continuous arcs connecting the vertices. If every edge is drawn as a straight-line segment, then G is called a geometric graph. A k-grid in a t ...

Elsevier Science Bv2014

On sums of graph eigenvalues

Joachim Stubbe

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both the standard combi ...

Elsevier Science Inc2014

Triangle-free intersection graphs of line segments with large chromatic number

Bartosz Maria Walczak, Michal Lason

In the 1970s Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer k we construct a triangle-free fam ...

Academic Press Inc Elsevier Science2014