Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
—We consider the adaptive throughput optimization problem for multiple-input multiple-output (MIMO) systems in Rayleigh fading channels. With perfect channel knowledge at the tra...
This paper introduces DEVIATION, a soft global constraint to obtain balanced solutions. A violation measure of the perfect balance can be defined as the Lp norm of the vector vari...
Pierre Schaus, Yves Deville, Pierre Dupont, Jean-C...
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...