520 search results - page 26 / 104 » Reductions Between Expansion Problems |
135
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
115
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We consider the task of dimensionality reduction for regression (DRR) whose goal is to find a low dimensional representation of input covariates, while preserving the statistical ...
120
click to vote
DLOG
2008
15 years 4 months ago
2008
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
114
Voted
TJS
2002
15 years 2 months ago
2002
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper explores the approximation properties of a unique basis expansion, which realizes a bilinear frequency warping between a continuous-time signal and its discrete-time re...