Sciweavers

393 search results - page 55 / 79
» Convex Programming Methods for Global Optimization
Sort
View
ICCV
2009
IEEE
15 years 16 days ago
Tensor completion for estimating missing values in visual data
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...
ICML
2002
IEEE
14 years 8 months ago
Learning the Kernel Matrix with Semi-Definite Programming
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. ...
ICCD
2008
IEEE
175views Hardware» more  ICCD 2008»
14 years 4 months ago
On-chip high performance signaling using passive compensation
— 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...
Yulei Zhang, Ling Zhang, Akira Tsuchiya, Masanori ...
CDC
2008
IEEE
236views Control Systems» more  CDC 2008»
14 years 2 months ago
Non-monotonic Lyapunov functions for stability of discrete time nonlinear and switched systems
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...
Amir Ali Ahmadi, Pablo A. Parrilo
MP
2008
135views more  MP 2008»
13 years 7 months ago
A path to the Arrow-Debreu competitive market equilibrium
: 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 ...
Yinyu Ye