Sciweavers

1202 search results - page 11 / 241
» Robust system multiangulation using subspace methods
Sort
View
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
13 years 11 months ago
Parametric model order reduction accelerated by subspace recycling
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
Lihong Feng, Peter Benner, Jan G. Korvink
IEEEVAST
2010
13 years 2 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
AIPS
1994
13 years 8 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
ICCV
2011
IEEE
12 years 7 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
IJCV
2006
206views more  IJCV 2006»
13 years 7 months ago
Random Sampling for Subspace Face Recognition
Subspacefacerecognitionoftensuffersfromtwoproblems:(1)thetrainingsamplesetissmallcompared with the high dimensional feature vector; (2) the performance is sensitive to the subspace...
Xiaogang Wang, Xiaoou Tang