We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
Sensory systems often use groups of redundant neurons to represent stimulus information both during transduction and population coding of features. This redundancy makes the syste...
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...