Sciweavers

730 search results - page 70 / 146
» Faster dimension reduction
Sort
View
IDEAL
2003
Springer
14 years 2 months ago
GMM Based on Local Fuzzy PCA for Speaker Identification
To reduce the high dimensionality required for training of feature vectors in speaker identification, we propose an efficient GMM based on local PCA with Fuzzy clustering. The prop...
JongJoo Lee, JaeYeol Rheem, Ki Yong Lee
ICPR
2010
IEEE
13 years 6 months ago
Local Jet Based Similarity for NL-Means Filtering
Reducing the dimension of local descriptors in images is useful to perform pixels comparison faster. We show here that, for enhancing and optimising the computation of the NL-mean...
Antoine Manzanera
NIPS
2004
13 years 10 months ago
Two-Dimensional Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
Jieping Ye, Ravi Janardan, Qi Li
JUCS
2010
117views more  JUCS 2010»
13 years 7 months ago
NP-completeness and FPT Results for Rectilinear Covering Problems
Abstract: This paper discusses three rectilinear (that is, axis-parallel) covering problems in d dimensions and their variants. The first problem is the Rectilinear Line Cover whe...
Vladimir Estivill-Castro, Apichat Heednacram, Fran...
AAAI
1993
13 years 10 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler