MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
— This paper proposes a new blind equalization scheme based on widely linear (WL) prediction. It permits to compensate non-minimum phase channels with or without spectral nulls, ...
Francisco J. A. de Aquino, Carlos A. F. da Rocha, ...
We address image parsing in the setting of architectural scenes. Our goal is to parse an image into regions of various types such as sky, foliage, buildings, and street. Furthermo...
Alexander C. Berg, Floraine Grabler, Jitendra Mali...