Sciweavers

440 search results - page 49 / 88
» Learning the structure of manifolds using random projections
Sort
View
AMAI
1999
Springer
14 years 11 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
TNN
1998
111views more  TNN 1998»
14 years 11 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
AIPR
2005
IEEE
15 years 5 months ago
Hyperspectral Detection Algorithms: Operational, Next Generation, on the Horizon
Abstract—The multi-band target detection algorithms implemented in hyperspectral imaging systems represent perhaps the most successful example of image fusion. A core suite of su...
A. Schaum
PR
2007
88views more  PR 2007»
14 years 11 months ago
Robust kernel Isomap
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
Heeyoul Choi, Seungjin Choi
MM
2004
ACM
248views Multimedia» more  MM 2004»
15 years 5 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He