Publication

On the facet-to-facet property of solutions to convex parametric quadratic programs

Publications associées (51)

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

Configurational entropy of hard spheres

Giuseppe Foffi

We numerically calculate the configurational entropy Sconf of a binary mixture of hard spheres, by using a perturbed Hamiltonian method trapping the system inside a given state, which requires fewer assumptions than the previous methods (Speedy 1998 Mol.Ph ...

2007

Periodic Green's function for skewed 3-D lattices using the Ewald transformation

Juan Ramon Mosig, Ivica Stevanovic

We apply the Ewald acceleration technique to the efficient evaluation of periodic Green's functions (GFs) for 3-D skewed lattices like those arising in electromagnetic/photonic band-gap (EBG/PBG) structures and metamaterials (MTMs). We develop the expressi ...

2007

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2007

On the facet-to-facet property of solutions to convex parametric quadratic programs

Colin Neil Jones

In some of the recently developed algorithms for convex parametric quadratic programs it is implicitly assumed that the intersection of the closures of two adjacent critical regions is a facet of both closures; this will be referred to as the facet-to-face ...

2006

Tracking Atoms with Particles

Pierre Vandergheynst, Gianluca Monaci, Emilio Maggio

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

2006

Rate-Distortion Optimized Tree-Structured Compression Algorithms for Piecewise Polynomial Images

Martin Vetterli, Pier Luigi Dragotti, Minh Do, Rahul Shukla

This paper presents novel coding algorithms based on tree-structured segmentation, which achieve the correct asymp- totic rate-distortion (R-D) behavior for a simple class of signals, known as piecewise polynomials, by using an R-D based prune and join sch ...

2005

Branch-and-Prune Search Strategies for Numerical Constraint Solving

Boi Faltings, Marius-Calin Silaghi, Xuan-Ha Vu

When solving numerical constraints such as nonlinear equations and inequalities, solvers often exploit pruning techniques, which remove redundant value combinations from the domains of variables, at pruning steps. To find the complete solution set, most of ...

2005

General state-space models

Thomas Gsponer

In time series analysis state-space models provide a wide and flexible class. The basic idea is to describe an unobservable phenomenon of interest on the basis of noisy data. The first constituent of such a model is the so-called state equation, which char ...

EPFL2004

Lower Bounds on Generic Broadcast Algorithms

André Schiper, Fernando Pedone

This paper establishes tight lower bounds on the time complexity of algorithms solving the generic broadcast problem. Generic broadcast assumes a symmetric, non-reflexive conflict relation on the set of messages, and requires ordered delivery only for conf ...

2004

On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. © 2004 Elsevie ...

2004