Sciweavers

1469 search results - page 80 / 294
» Approximate polynomial decomposition
Sort
View
IEEEMSP
2002
IEEE
15 years 2 months ago
An optimal shape encoding scheme using skeleton decomposition
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...
ICML
1994
IEEE
15 years 1 months ago
A Modular Q-Learning Architecture for Manipulator Task Decomposition
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...
Chen K. Tham, Richard W. Prager
NIPS
2004
14 years 11 months ago
Efficient Kernel Discriminant Analysis via QR Decomposition
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
Tao Xiong, Jieping Ye, Qi Li, Ravi Janardan, Vladi...
NETWORKING
2000
14 years 11 months ago
Fairness and Aggregation: A Primal Decomposition Study
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...
André Girard, Catherine Rosenberg, Mohammed...
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 4 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...