Publication
Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport
Related publications (33)
Privacy and Dynamics of Social Networks
Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...
EPFL2013A Bayesian Method for Matching Two Similar Graphs without Seeds
Matthias Grossglauser, Pedram Pedarsani
Approximate graph matching (AGM) refers to the problem of mapping the vertices of two structurally similar graphs, which has applications in social networks, computer vision, chemistry, and biology. Given its computational cost, AGM has mostly been limited ...
2013Graph-based representation and coding of multiview geometry
Pascal Frossard, Thomas Maugey
We propose a new approach for describing the geometry information of multiview image representations. Rather than transmitting the raw geometry of the scene, under the form of depth information, we build a graph that represents the connections between corr ...
2013Privacy and Dynamics of Social Networks (PhD Thesis: pre-print)
Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...
2012Leveraging User-Generated Content for Information Discovery on the Web
The large-scale adoption of the Web 2.0 paradigm has revolutionized the way we interact with the Web today. End-users, so far mainly passive consumers of information are now becoming active information producers, creating, uploading, and commenting on all ...
EPFL2010Embedded deformation for shape manipulation
We present an algorithm that generates natural and intuitive deformations via direct manipulation for a wide range of shape representations and editing scenarios. Our method builds a space deformation represented by a collection of affine transformations o ...
2007Dexterous manipulation planning using probabilistic roadmaps in continuous grasp subspaces
In this paper, we propose a new method for the motion planning problem of rigid object dexterous manipulation with a robotic multi-fingered hand, under quasi-static movement assumption. This method computes both object and finger trajectories as well as th ...
2007Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings
Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp, Jörg Widmer
Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...
2007Sampling Cluster Endurance for Peer-to-Peer based Content Distribution Networks
Several types of Content Distribution Networks are being deployed over the Internet today, based on different architectures to meet their requirements (e.g., scalability, efficiency and resiliency). Peer-to-peer (P2P) based Content Distribution Networks ar ...
2007Distributed constraint satisfaction for coordinating and integrating a large-scale, heterogeneous enterprise
Market forces are continuously driving public and private organisations towards higher productivity, shorter process and production times, and fewer labour hours. To cope with these changes, organisations are adopting new organisational models of coordinat ...
EPFL2003