1051 search results - page 73 / 211 » An algorithm for the principal component analysis of large d... |
EDBT
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
Recently morphological diversity and sparsity have emerged as new and effective sources of diversity for Blind Source Separation. Based on these new concepts, novel methods such a...
KES
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
NIPS
2003
13 years 9 months ago
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
FORMATS
2007
Springer
14 years 21 hour ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...