Publications related to Counting problem (complexity)

cRacklet: a spectral boundary integral method library for interfacial rupture simulation

Jean-François Molinari, Thibault Didier Roch, Fabian Barras

The study of dynamically propagating rupture along interfaces is of prime importance in various fields and system sizes, including tribology (nm to m), engineering (mm to m) and geophysics (m to km) (Armstrong-Hélouvry et al., 1994; Ben-Zion, 2008; Vanossi ...

2022

A method for faster application of process integration techniques in retrofit situations

Tuong-Van Nguyen

Numerous process integration techniques were proved to be highly effective for identifying and estimating potential energy savings in the industry. However, they require high time and effort to collect and analyse process data. As a result, they do not con ...

ELSEVIER SCI LTD2021

Adaptation in Stochastic Algorithms: From Nonsmooth Optimization to Min-Max Problems and Beyond

Ahmet Alacaoglu

Stochastic gradient descent (SGD) and randomized coordinate descent (RCD) are two of the workhorses for training modern automated decision systems. Intriguingly, convergence properties of these methods are not well-established as we move away from the spec ...

EPFL2021

Fast and Space Efficient Spectral Sparsification in Dynamic Streams

Mikhail Kapralov, Jakab Tardos, Navid Nouri, Aidasadat Mousavifar

In this paper, we resolve the complexity problem of spectral graph sparcification in dynamic streams up to polylogarithmic factors. Using a linear sketch we design a streaming algorithm that uses (O) over tilde (n) space, and with high probability, recover ...

ASSOC COMPUTING MACHINERY2020

Second-order sensitivity in the cylinder wake: Optimal spanwise-periodic wall actuation and wall deformation

François Gallaire, Edouard Boujo, Andrea Fani

Two-dimensional (2D) flows can be controlled efficiently using spanwise "waviness," i.e., a control (e.g., wall blowing and suction or wall deformation) that is periodic in the spanwise direction. This study tackles the global linear stability of 2D flows ...

AMER PHYSICAL SOC2019

The Sketching Complexity of Graph and Hypergraph Counting

Mikhail Kapralov, John Michael Goddard Kallaugher

Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been ...

IEEE COMPUTER SOC2018

Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage

Volkan Cevher, Alp Yurtsever

This paper considers a fundamental class of convex matrix optimization problems with low-rank solutions. We show it is possible to solve these problem using far less memory than the natural size of the decision variable when the problem data has a concise ...

2017

XOR-Based Encoding With Instantaneous Decoding for the Broadcast Erasure Channel With Feedback: The Three-User Case

We study the case of a three-user broadcast erasure channel with multiple unicast traffic sessions, where feedback from the users is fed back to the transmitter in the form of positive acknowledgment (ACK)/negative acknowledgment (NACK) messages. The capac ...

Institute of Electrical and Electronics Engineers2014

Approximation algorithms for regret minimization in vehicle routing problems

Adrian Aloysius Bock

In this thesis, we present new approximation algorithms as well as hardness of approximation results for NP-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such a ...

EPFL2014

On the DCJ Median Problem

Bernard Moret, Mingfu Shao

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...

Springer-Verlag Berlin2014

Learning search polices from humans in a partially observable context

Aude Billard, Guillaume Pierre Luc De Chambrier

Decision making and planning for which the state information is only partially available is a problem faced by all forms of intelligent entities they being either virtual, synthetic or biological. The standard approach to mathematically solve such a decisi ...

2014

A reduced basis hybrid method for the coupling of parametrized domains represented by fluidic networks

Alfio Quarteroni, Gianluigi Rozza, Laura Iapichino

In this paper we propose a reduced basis hybrid method (RBHM) for the approximation of partial differential equations in domains represented by complex networks where topological features are recurrent. The RBHM is applied to Stokes equations in domains wh ...

Elsevier2012

Reduced Basis Methods for the Solution of Parametrized PDEs in Repetitive and Complex Networks with Application to CFD

Laura Iapichino

The objective of this work is to develop a numerical framework to perform rapid and reliable simulations for solving parametric problems in domains represented by networks and to extend the classical reduced basis method. Aimed at this scope, we propose tw ...

EPFL2012

Efficient Interior Point Methods for Multistage Problems Arising in Receding Horizon Control

Colin Neil Jones, Melanie Nicole Zeilinger

Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...

2012

Efficient Interior Point Methods for Multistage Problems Arising in Receding Horizon Control

Colin Neil Jones, Melanie Nicole Zeilinger

Receding horizon control requires the solution of an optimization problem at every sampling instant. We present efficient interior point methods tailored to convex multistage problems, a problem class which most relevant MPC problems with linear dynamics c ...

2012

Stabilized reduced basis approximation of incompressible three-dimensional Navier–Stokes equations in parametrized deformed domains

Simone Deparis

In this work we are interested in the numerical solution of the steady incompressible Navier-Stokes equations for fluid flow in pipes with varying curvatures and cross-sections. We intend to compute a reduced basis approximation of the solution, employing ...

Springer Verlag2012

Lagrange-Poincare field equations

Tudor Ratiu, François Gay-Balmaz

The Lagrange-Poincare equations of classical mechanics are cast into a field theoretic context together with their associated constrained variational principle. An integrability/reconstruction condition is established that relates solutions of the original ...

2011

Inverse solutions for classifying Event Related Potentials

José del Rocio Millán Ruiz, Ricardo Andres Chavarriaga Lozano, Mohit Kumar Goel

In this paper we want to show the use of inverse solutions ‒in particular cortical current density (CCD)‒with respect to the current surface electroencephalogram (EEG) in classifying event related potentials. We construct feature vector from selected chann ...

2011