Sciweavers

520 search results - page 26 / 104
» Reductions Between Expansion Problems
Sort
View
CVPR
2005
IEEE
14 years 10 months ago
Graph Embedding: A General Framework for Dimensionality Reduction
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...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
CVPR
2008
IEEE
14 years 10 months ago
Dimensionality reduction using covariance operator inverse regression
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 ...
Minyoung Kim, Vladimir Pavlovic
DLOG
2008
13 years 11 months ago
Realization Problem for Formal Concept Analysis
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
Nikolay Shilov
TJS
2002
122views more  TJS 2002»
13 years 8 months ago
Optimal BSR Solutions to Several Convex Polygon Problems
Abstract. This paper focuses on BSR (Broadcasting with Selective Reduction) implementation of algorithms solving basic convex polygon problems. More precisely, constant time soluti...
Jean Frédéric Myoupo, David Sem&eacu...
ICASSP
2008
IEEE
14 years 3 months ago
Signal approximation using the bilinear transform
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...
Archana Venkataraman, Alan V. Oppenheim