Sciweavers

895 search results - page 67 / 179
» Approximate convex decomposition
Sort
View
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...
ICIP
2004
IEEE
15 years 11 months ago
Redundant image representations in security applications
To be efficient, data protection algorithms should generally exploit the properties of the media information in the transform domain. In this paper, we will advocate the use of no...
Philippe Jost, Pierre Vandergheynst, Pascal Frossa...
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
15 years 4 months ago
Compositional Models for Reinforcement Learning
Abstract. Innovations such as optimistic exploration, function approximation, and hierarchical decomposition have helped scale reinforcement learning to more complex environments, ...
Nicholas K. Jong, Peter Stone
COCOON
2010
Springer
14 years 8 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen