Publications related to Evolutionary Multiresolution Matching Pursuit and its Relations with the Human Visual System

Duality and bicrystals on infinite binary matrices

The set of finite binary matrices of a given size is known to carry a finite type AA bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and one-dimensional sums t ...

2023

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...

2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...

2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...

2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...

2022

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

Giovanni De Micheli, Heinz Riener, Siang-Yun Lee

Logic resynthesis is the problem of finding a dependency function to re-express a given Boolean function in terms of a given set of divisor functions. In this paper, we study logic resynthesis of majority-based circuits, which is motivated by the increasin ...

IEEE2021

SD-Pose: Semantic Decomposition for Cross-Domain 6D Object Pose Estimation

Mathieu Salzmann, Yinlin Hu, Zhigang Li

The current leading 6D object pose estimation methods rely heavily on annotated real data, which is highly costly to acquire. To overcome this, many works have proposed to introduce computer-generated synthetic data. However, bridging the gap between the s ...

ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2021

Frequency-Domain Non-intrusive Greedy Model Order Reduction Based on Minimal Rational Approximation

Fabio Nobile, Davide Pradovera

We present a technique for Model Order Reduction (MOR) of frequency-domain problems relying on rational interpolation of vector-valued functions. The selection of the sample points is carried out adaptively according to a greedy procedure. We describe seve ...

SPRINGER INTERNATIONAL PUBLISHING AG2021

Distributed Design for Decentralized Control using Chordal Decomposition and ADMM

Maryam Kamgarpour

We propose a distributed design method for decentralized control by exploiting the underlying sparsity properties of the problem. Our method is based on chordal decomposition of sparse block matrices and the alternating direction method of multipliers (ADM ...

2020

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020

Evolutionary Multiresolution Matching Pursuit and its Relations with the Human Visual System

Graph Chatbot

Chat with Graph Search

Duality and bicrystals on infinite binary matrices

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

SD-Pose: Semantic Decomposition for Cross-Domain 6D Object Pose Estimation

Frequency-Domain Non-intrusive Greedy Model Order Reduction Based on Minimal Rational Approximation

Distributed Design for Decentralized Control using Chordal Decomposition and ADMM

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Distributed Design for Decentralized Control using Chordal Decomposition and ADMM

Duality and bicrystals on infinite binary matrices

Logic Resynthesis of Majority-Based Circuits by Top-Down Decomposition

Frequency-Domain Non-intrusive Greedy Model Order Reduction Based on Minimal Rational Approximation

SD-Pose: Semantic Decomposition for Cross-Domain 6D Object Pose Estimation

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models