Abstract—The theoretical analysis of randomized compressive operators often relies on the existence of a concentration of measure inequality for the operator of interest. Though ...
Christopher J. Rozell, Han Lun Yap, Jae Young Park...
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
— This work proposes a control algorithm to stabilize a circular formation of AUVs tracking a time-varying center. We also consider the problem of uniform distribution of all the...
Lara B. Arranz, Alexandre Seuret, Carlos Canudas d...
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
S. V. N. Vishwanathan, Karsten M. Borgwardt, Omri ...