Publications related to Bisection method

SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

David Atienza Alonso, Giovanni Ansaloni, José Angel Miranda Calero, Rubén Rodríguez Álvarez, Juan Pablo Sapriza Araujo, Benoît Walter Denkinger

Coarse-Grain Reconfigurable Arrays (CGRAs) represent emerging low-power architectures designed to accelerate Compute-Intensive Loops (CILs). The effectiveness of CGRAs in providing acceleration relies on the quality of mapping: how efficiently the CIL is c ...

2024

Variational methods for finding periodic orbits in the incompressible Navier Stokes equations

Tobias Schneider, Jeremy Peter Parker

Unstable periodic orbits are believed to underpin the dynamics of turbulence, but by their nature are hard to find computationally. We present a family of methods to converge such unstable periodic orbits for the incompressible Navier-Stokes equations, bas ...

CAMBRIDGE UNIV PRESS2022

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Adaptive Gradient Descent without Descent

Konstantin Mishchenko

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

Performance limits of stochastic sub-gradient learning, Part II: Multi-agent case

Ali H. Sayed, Bicheng Ying

The analysis in Part I [1] revealed interesting properties for subgradient learning algorithms in the context of stochastic optimization. These algorithms are used when the risk functions are non-smooth or involve non-differentiable components. They have b ...

Elsevier2018

Design of Approximate Circuits by Fabrication of False Timing Paths: The Carry Cut-Back Adder

Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter, Mattia Cacciotti

This paper introduces a novel method for designing approximate circuits by fabricating and exploiting false timing paths, i.e. critical paths that cannot be logically activated. This allows to strongly relax timing constraints while guaranteeing minimal an ...

2018

Variational Methods for Human Modeling

Timur Bagautdinov

A large part of computer vision research is devoted to building models and algorithms aimed at understanding human appearance and behaviour from images and videos. Ultimately, we want to build automated systems that are at least as capable as people when i ...

EPFL2018

Back to the Source: an Online Approach for Sensor Placement and Source Localization

Patrick Thiran, Laura Elisa Celis, Brunella Marta Spinelli

Source localization, the act of finding the originator of a disease or rumor in a network, has become an important problem in sociology and epidemiology. The localization is done using the infection state and time of infection of a few designated sensor no ...

2017

The equivalent pier method for energy pile groups

Lyesse Laloui, Alessandro Francesco Rotta Loria

This study presents a method for estimating the average vertical displacement of energy pile groups subjected to thermal loads. The method consists of replacing any regular energy pile group with a single equivalent pier of the same length and an equivalen ...

2017

The equivalent pier method for energy pile groups

Lyesse Laloui, Alessandro Francesco Rotta Loria

This study presents a method for estimating the average vertical displacement of energy pile groups subjected to thermal loads. The method consists of replacing any regular energy pile group with a single equivalent pier of the same length and an equivalen ...

2017

Bisection method

Graph Chatbot

Chat with Graph Search

SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

Variational methods for finding periodic orbits in the incompressible Navier Stokes equations

A first-order primal-dual method with adaptivity to local smoothness

Adaptive Gradient Descent without Descent

Performance limits of stochastic sub-gradient learning, Part II: Multi-agent case

Design of Approximate Circuits by Fabrication of False Timing Paths: The Carry Cut-Back Adder

Variational Methods for Human Modeling

Back to the Source: an Online Approach for Sensor Placement and Source Localization

The equivalent pier method for energy pile groups

The equivalent pier method for energy pile groups

Back to the Source: an Online Approach for Sensor Placement and Source Localization

A first-order primal-dual method with adaptivity to local smoothness

Design of Approximate Circuits by Fabrication of False Timing Paths: The Carry Cut-Back Adder

The equivalent pier method for energy pile groups

Variational methods for finding periodic orbits in the incompressible Navier Stokes equations

SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

Performance limits of stochastic sub-gradient learning, Part II: Multi-agent case

Variational Methods for Human Modeling

Adaptive Gradient Descent without Descent

The equivalent pier method for energy pile groups