Publication

An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices

Publications associées (72)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Enumeration of reversible functions and its application to circuit complexity

Giovanni De Micheli, Mathias Soeken, Nabila Abdessaied

We review combinational results to enumerate and classify reversible functions and investigate the application to circuit complexity. In particularly, we consider the effect of negating and permuting input and output variables and the effect of applying li ...

Springer2016

Fast Robust PCA on Graphs

Pierre Vandergheynst, Gilles Puy, Nathanaël Perraudin, Nauman Shahid, Vasilis Kalofolias

Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-linear dimensionality reduction has played an important role to overcome the c ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

Pierre Vandergheynst, Nathanaël Perraudin, Nauman Shahid

Many real world datasets subsume a linear or non-linear low-rank structure in a very low-dimensional space. Unfortunately, one often has very little or no information about the geometry of the space, resulting in a highly under-determined recovery problem. ...

2016

A Thrifty Universal Construction

Rachid Guerraoui, Cheng Wang

A universal construction is an algorithm which transforms any sequential implementation of an object into a concurrent implementation of that same object in a linearizable and wait-free manner. Such constructions require underlying low-level universal shar ...

2015

Enumeration-based approach to solving parametric linear complementarity problems

Colin Neil Jones

This paper presents a solution method for parametric linear complementarity problems (PLCP) that relies on an enumeration technique to discover all feasible bases. The enumeration procedure is based on evaluating all possible combinations of active constra ...

Elsevier2015

Incorporating advanced behavioral models in integer optimization

Michel Bierlaire, Shadi Sharif Azadeh

Modern demand models rely on discrete choice models. These models are able to predict the choice behavior of individuals in a detailed way, accounting not only for the price and quality of the goods, but also for the characteristics of the customers. Conse ...

2015

On Convergence Of The Maximum Block Improvement Method

André Uschmajew

The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is rel ...

Siam Publications2015

Asymptotics of action variables near semi-toric singularities

The presence of focus-focus singularities in semi-toric integrables Hamiltonian systems is one of the reasons why there cannot exist global Action-Angle coordinates on such systems. At focus-focus critical points, the Liouville-Arnold-Mineur theorem does n ...

Elsevier2015

Scalable Probabilistic Models for Face and Speaker Recognition

Laurent El Shafey

In the biometrics community, face and speaker recognition are mature fields in which several systems have been proposed over the past twenty years. While existing systems perform well under controlled recording conditions, mismatch caused by the use of dif ...

EPFL2014

Fixed-Rank Rayleigh Quotient Maximization by an MPSK Sequence

Anastasios Kyrillidis

Certain optimization problems in communication systems, such as limited-feedback constant-envelope beamforming or noncoherent M-ary phase-shift keying (MPSK) sequence detection, result in the maximization of a fixed-rank positive semidefinite quadratic for ...

Institute of Electrical and Electronics Engineers2014