Publication

Time-critical multiresolution rendering of large complex models

Related publications (55)

MATHICSE Technical Report : A fast gradient method for nonnegative sparse regression with self dictionary

Robert Gerhard Jérôme Luce

Nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the input data matrix belong to the convex cone generated by only a few of its columns. The provably most robust met ...
MATHICSE2016

Optimal Hybrid Perimeter and Switching Plans Control for Urban Traffic Networks

Nikolaos Geroliminis, Jack Haddad, Mohammadreza Hajiahmadi

Since centralized control of urban networks with detailed modeling approaches is computationally complex, developing efficient hierarchical control strategies based on aggregate modeling is of great importance. The dynamics of a heterogeneous large-scale u ...
Institute of Electrical and Electronics Engineers2015

An optimal first-order primal-dual gap reduction framework for constrained convex optimization

Volkan Cevher, Quoc Tran Dinh

We introduce an analysis framework for constructing optimal first-order primal-dual methods for the prototypical constrained convex optimization template. While this class of methods offers scalability advantages in obtaining numerical solutions, they have ...
Tech. Report. LIONS-EPFL (2015)2015

Generalized Decision Rule Approximations for Stochastic Programming via Liftings

Daniel Kuhn, Wolfram Wiesemann

Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that, primal and dual linear decision rule approximations can ...
Springer Verlag2015

Disparity and Optical Flow Partitioning Using Extended Potts Priors

Martin Kurt Storath

This paper addresses the problems of disparity and optical flow partitioning based on the brightness invariance assumption. We investigate new variational approaches to these problems with Potts priors and possibly box constraints. For the optical flow par ...
IMA2015

An Optimization-based Approach to Extract Faceted Crystal Shapes from Stereoscopic Images

Colin Neil Jones, Jean-Hubert Hours, Thomas Vetter

The size and shape of particles crucially influences the characteristics of solid products. Until recently these quantities were evaluated using light microscopy. However, extracting the three-dimensional shape of a faceted crystal from a single image is a ...
Elsevier2015

An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs Application to the AC Optimal Power Flow

Colin Neil Jones, Jean-Hubert Hours

A novel trust region method for solving linearly constrained nonlinear programs is presented. The proposed technique is amenable to a distributed implementation, as its salient ingredient is an alternating projected gradient sweep in place of the Cauchy po ...
2015

ShapeOp - A Robust and Extensible Geometric Modelling Paradigm

Mark Pauly, Sofien Bouaziz, Bailin Deng, Mario Moacir Deuss, Anders Holden Deleuran

We present ShapeOp, a robust and extensible geometric modelling paradigm. ShapeOp builds on top of the state-of-the-art physics solver (Bouaziz et al. in ACM Trans Graph 33:154:1–154:11, 2014). We discuss the main theoretical advantages of the underlying s ...
Springer 2015

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a source that would like to communicate with a destination over a layered Gaussian relay network. We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting ...
2014

Efficient Subnetwork Selection in Relay Networks

Christina Fragouli, Siddhartha Brahma, Ayan Sengupta

We consider a source that would like to communicate with a destination over a layered Gaussian relay network. We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting ...
Ieee2014

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.