Publications related to Fabrication-aware Design with Intersecting Planar Pieces

Heuristic-driven Graph Wavelet Modeling of Complex Terrain

Alexandre Buttler, François Golay, Alexander Ludwig Johannes Peringer, Ioana Stoicescu

We present a novel method for building a multiresolution representation of large digital surface models. The surface points coincide with the nodes of a planar graph which can be processed using a critically sampled, invertible lifting scheme. To drive the ...

Spie-Int Soc Optical Engineering2015

A Primal-dual Framework For Mixtures Of Regularisers

Volkan Cevher, Cosimo Aprile, Quoc Tran Dinh, Luca Baldassarre, Baran Gözcü

Effectively solving many inverse problems in engineering requires to leverage all possible prior information about the structure of the signal to be estimated. This often leads to tackling constrained optimization problems with mixtures of regularizers. Pr ...

2015

Node-weighted network design and maximum sub-determinants

Carsten Moldenhauer

We consider the Node-weighted Steiner Forest problem on planar graphs. Demaine et al. showed that a generic primal-dual algorithm gives a 6-approximation. We present two different proofs of an approximation factor of~

3

. Then, we draw a connection to Goem ...

EPFL2014

MATHICSE Technical Report : Optimization of mesh hierarchies in multilevel Monte Carlo samplers

Fabio Nobile, Erik Gustaf Bogislaw Von Schwerin

We perform a general optimization of the parameters in the Multilevel Monte Carlo (MLMC) discretization hierarchy based on uniform discretization methods with general approximation orders and computational costs. Moreover, we discuss extensions to non-unif ...

MATHICSE2014

Automated Reconstruction of Curvilinear Networks from 2D and 3D Imagery

Engin Türetken

Reconstructing complex curvilinear structures such as neural circuits, road networks, and blood vessels is a key challenge in many scientific and engineering fields. It has a broad range of applications, from the delineation of micrometer-sized neurons in ...

EPFL2013

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

2013

Design and Optimization of Orthogonally Intersecting Planar Surfaces

Mark Pauly, Yuliy Gennadievich Schwartzburg

We present a method for the design of 3D constructions from planar pieces that can be cut easily and cheaply with laser cutters and similar Computer Numerical Control (CNC) machines. By cutting tight slits in intersecting pieces, they can be slid into each ...

Springer Berlin Heidelberg2012

Efficient graph planarization in sensor networks and local routing algorithm

Florian Huc

In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC). Our first algorithm computes a planar 2-spanner under ligh ...

Ieee2012

Coordination and Sampling in Distributed Constraint Optimization

Brammert Ottens

The Distributed Constraint Optimization (DCOP) framework can be used to model a wide range of optimization problems that are inherently distributed. A distributed optimization problem can be viewed as a problem distributed over a set of agents, where agent ...

EPFL2012

Graph-Based Information Processing

Amin Karbasi

We live in a world characterized by massive information transfer and real-time communication. The demand for efficient yet low-complexity algorithms is widespread across different fields, including machine learning, signal processing and communications. Mo ...

EPFL2012

Fabrication-aware Design with Intersecting Planar Pieces

Graph Chatbot

Chat with Graph Search

Heuristic-driven Graph Wavelet Modeling of Complex Terrain

A Primal-dual Framework For Mixtures Of Regularisers

Node-weighted network design and maximum sub-determinants

MATHICSE Technical Report : Optimization of mesh hierarchies in multilevel Monte Carlo samplers

Automated Reconstruction of Curvilinear Networks from 2D and 3D Imagery

A Bayesian Method for Matching Two Similar Graphs without Seeds

Design and Optimization of Orthogonally Intersecting Planar Surfaces

Efficient graph planarization in sensor networks and local routing algorithm

Coordination and Sampling in Distributed Constraint Optimization

Graph-Based Information Processing

Graph-Based Information Processing

Efficient graph planarization in sensor networks and local routing algorithm

Design and Optimization of Orthogonally Intersecting Planar Surfaces

Node-weighted network design and maximum sub-determinants

A Bayesian Method for Matching Two Similar Graphs without Seeds

A Primal-dual Framework For Mixtures Of Regularisers

MATHICSE Technical Report : Optimization of mesh hierarchies in multilevel Monte Carlo samplers

Coordination and Sampling in Distributed Constraint Optimization

Automated Reconstruction of Curvilinear Networks from 2D and 3D Imagery

Heuristic-driven Graph Wavelet Modeling of Complex Terrain