Publications related to Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Fast K-Means with Accurate Bounds

We propose a novel accelerated exact

k

-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3

\times

faster. We also propose a general improvement of existing state-of-the-art a ...

Idiap2016

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Assyr Abdulle, Gilles Vilmart, Yun Bai

Inspired by recent analyses of the finite element heterogeneous multiscale method and the reduced basis technique for nonlinear problems, we present a simple and concise finite element algorithm for the reliable and efficient resolution of elliptic or para ...

Wiley-Blackwell2014

Sensing the real world

Juri Ranieri

A sensor is a device that detects or measures a physical property and records, indicates, or otherwise responds to it. In other words, a sensor allows us to interact with the surrounding environment, by measuring qualitatively or quantitatively a given phe ...

EPFL2014

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Jan Sickmann Hesthaven, Benjamin Stamm

We propose two new and enhanced algorithms for greedy sampling of high- dimensional functions. While the techniques have a substantial degree of generality, we frame the discussion in the context of methods for empirical interpolation and the devel- opment ...

EDP Sciences2014

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Pénélope Leyland, Ojas Joshi

Numerical multiphysics coupling is gaining more and more importance in engineering. Partitioned algorithms are among the most efficient methods to solve the coupled problem. However, they present some drawbacks, with the stability of the algorithm itself b ...

Amer Inst Aeronautics Astronautics2014

Socially-Aware Large-Scale Crowd Forecasting

Alexandre Massoud Alahi, Vignesh Ramanathan

In crowded spaces such as city centers or train stations, human mobility looks complex, but is often influenced only by a few causes. We propose to quantitatively study crowded environments by introducing a dataset of 42 million trajectories collected in t ...

IEEE2014

Mechanisms for actuated assistive hip orthoses

Hannes Bleuler, Mohamed Bouri, Jeremy Olivier, Amalric Louis Ortlieb

Mobility is often a central problem for people having muscle weaknesses. The need for new devices to assist walking and walk related activities is therefore growing. Lower limb actuated orthoses have already proven their positive impact with paraplegic pat ...

Elsevier2014

Overview of New Approaches for Approximating TSP

Ola Nils Anders Svensson

n this extended abstract, we survey some of the recent results on approximating the traveling salesman problem on graphic metrics. We start by briefly explaining the algorithm of Oveis Gharan et al. [1] that has strong similarities to Christofides’ famo ...

Springer2013

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Graph Chatbot

Chat with Graph Search

Fast K-Means with Accurate Bounds

Centrality of trees for capacitated -center

Centrality of Trees for Capacitated k-Center

An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Sensing the real world

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Socially-Aware Large-Scale Crowd Forecasting

Mechanisms for actuated assistive hip orthoses

Overview of New Approaches for Approximating TSP

An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Fast K-Means with Accurate Bounds

Centrality of Trees for Capacitated k-Center

Sensing the real world

Stability Analysis of a Partitioned Fluid-Structure Thermal Coupling Algorithm

Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods

Centrality of trees for capacitated -center

Overview of New Approaches for Approximating TSP

Mechanisms for actuated assistive hip orthoses

Socially-Aware Large-Scale Crowd Forecasting