Publications associées à Comment on “Recent advances on solving the three-parameter infiltration equation” by Prabhata K. Swamee, Pushpa N. Rathie, Luan Carlos de S.M. Ozelim and André L.B. Cavalcante, Journal of Hydrology 509 (2014) 188-192

Approximation Algorithms for Allocation and Network Design

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

EPFL2023

Assessing real-world gait with digital technology? Validation, insights and recommendations from the Mobilise-D consortium

Kamiar Aminian, Anisoara Ionescu, Abolfazl Soltani, Francesca Salis

Background: Although digital mobility outcomes (DMOs) can be readily calculated from real-world data collected with wearable devices and ad-hoc algorithms, technical validation is still required. The aim of this paper is to comparatively assess and validat ...

BioMed Central2023

Linear regression analysis of regional mean speed of Athens city network using drone data: A multi-modal approach

Nikolaos Geroliminis, Emmanouil Barmpounakis

The work proposes a multi-modal regional mean speed regression analysis for the city network of Athens, Greece. The dataset from pNUEMA experiment is used in the present context. Accumulations and mean speeds of different modes are estimated and compared t ...

2021

Fundamental bounds on the precision of iSCAT, COBRI and dark-field microscopy for 3D localization and mass photometry

Jonathan Yuelin Dong

Interferometric imaging is an emerging technique for particle tracking and mass photometry. Mass or position are estimated from weak signals, coherently scattered from nanoparticles or single molecules, and interfered with a co-propagating reference. In th ...

2021

Algorithms for Walking Speed Estimation Using a Lower-Back-Worn Inertial Sensor: A Cross-Validation on Speed Ranges

Kamiar Aminian, Anisoara Ionescu, Abolfazl Soltani

Walking/gait speed is a key measure for daily mobility characterization. To date, various studies have attempted to design algorithms to estimate walking speed using an inertial sensor worn on the lower back, which is considered as a proper location for ac ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Adaptive algorithms for two fluids flows with anisotropic finite elements and order two time discretizations

Samuel Dubuis

This thesis is devoted to the derivation of a posteriori error estimates for the numerical approximation of fluids flows separated by a free surface. Based on these estimates, error indicators are introduced and adaptive algorithms are proposed to solve th ...

EPFL2020

Local approximation of the Maximum Cut in regular graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...

ELSEVIER2020

An Optimal Space Lower Bound for Approximating MAX-CUT

Mikhail Kapralov

We consider the problem of estimating the value of MAX-CUT in a graph in the streaming model of computation. At one extreme, there is a trivial 2-approximation for this problem that uses only O(log n) space, namely, count the number of edges and output hal ...

ASSOC COMPUTING MACHINERY2019

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming

Volkan Cevher, Alp Yurtsever

We propose a conditional gradient framework for a composite convex minimization template with broad applications. Our approach combines the notions of smoothing and homotopy under the CGM framework, and provably achieves the optimal O(1/sqrt(k)) convergenc ...

ICML2018

Applications of Strong Convex Relaxations to Allocation Problems

Christos Kalaitzis

Approximation algorithms are a commonly used tool for designing efficient algorithmic solutions for intractable problems, at the expense of the quality of the output solution. A prominent technique for designing such algorithms is the use of Linear Program ...

EPFL2017

A continuation multilevel Monte Carlo algorithm

Fabio Nobile, Erik Gustaf Bogislaw Von Schwerin

We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolera ...

2015

Hydrodynamic model calibration from pattern recognition of non-orthorectified terrestrial photographs

Paolo Perona

This paper presents a remote sensing technique for calibrating hydrodynamics models, which is particularly useful when access to the riverbed for a direct measure of flow variables may be precluded. The proposed technique uses terrestrial photography and a ...

Elsevier2014

Population Sensing Using Mobile Devices : a Statistical Opportunity or a Privacy Nightmare?

Farid Movahedi Naini

In our daily lives, our mobile phones sense our movements and interactions via a rich set of embedded sensors such as a GPS, Bluetooth, accelerometers, and microphones. This enables us to use mobile phones as agents for collecting spatio-temporal data. The ...

EPFL2014

New Results in the Theory of Linear and Integer Programming

Nicolai Hähnle

The polynomial Hirsch conjecture states that the vertex-edge diameter of a d-dimensional polyhedron with n facets is bounded by a polynomial in d and n. For the special case where the polyhedron is defined as the set of points satisfying a system Ax ≤ b of ...

EPFL2012

Image Denoising in Mixed Poisson-Gaussian Noise

Michaël Unser, Thierry Blu, Florian Luisier

We propose a general methodology (PURE-LET) to design and optimize a wide class of transform-domain thresholding algorithms for denoising images corrupted by mixed Poisson-Gaussian noise. We express the denoising process as a linear expansion of thresholds ...

Institute of Electrical and Electronics Engineers2011

Nonideal sampling and regularized interpolation of noisy data

Sathish Ramani

Conventional sampling (Shannon's sampling formulation and its approximation-theoretic counterparts) and interpolation theories provide effective solutions to the problem of reconstructing a signal from its samples, but they are primarily restricted to the ...

EPFL2009

New Hardness Results for Diophantine Approximation

Friedrich Eisenbrand, Thomas Rothvoss

We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error b ...

Springer2009