In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
— To address the performance limitation brought by the scaling issues of on-chip global wires, a new configuration for global wiring using on-chip lossy transmission lines(T-lin...
Abstract— We relax the monotonicity requirement of Lyapunov’s theorem to enlarge the class of functions that can provide certificates of stability. To this end, we propose two...
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...