Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
Rainer E. Burkard, Carmen Pleschiutschnig, Jianzho...
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or...
Abstract. Reverse-convex programming (RCP) concerns global optimization of a specific class of non-convex optimization problems. We show that a recently proposed model for sparse ...
Abstract— Spectrum management is used to improve performance in multiuser communication system, e.g., cognitive radio or femtocell networks, where multiuser interference can lead...