Sciweavers

1469 search results - page 159 / 294
» Approximate polynomial decomposition
Sort
View
NIPS
2004
15 years 8 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...
VCIP
2003
178views Communications» more  VCIP 2003»
15 years 8 months ago
Geometrical image compression with bandelets
This paper introduces a new class of bases, called bandelet bases, which decompose the image along multiscale vectors that are elongated in the direction of a geometric flow. Thi...
Erwan Le Pennec, Stéphane Mallat
NHM
2010
83views more  NHM 2010»
15 years 1 months ago
Schwarz waveform relaxation algorithms for semilinear reaction-diffusion equations
We introduce nonoverlapping domain decomposition algorithms of Schwarz waveform relaxation type for the semilinear reaction-diffusion equation. We define linear Robin and second or...
Filipa Caetano, Martin J. Gander, Laurence Halpern...
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
16 years 5 days ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
INFOCOM
2003
IEEE
16 years 6 days ago
A Queueing Network Model of an Edge Optical Burst Switching Node
— We consider an edge optical burst switching (OBS) node with or without converters, and with no buffering. The OBS node serves a number of users, each connected to the switch ov...
Lisong Xu, Harry G. Perros, George N. Rouskas