875 search results - page 69 / 175 » Linear Manifold Clustering |
129
click to vote
CGF
2005
15 years 18 days ago
2005
We introduce FreeLence, a novel and simple single-rate compression coder for triangle manifold meshes. Our method uses free valences and exploits geometric information for connect...
86
Voted
COMPUTING
2004
15 years 17 days ago
2004
We present a biorthogonal wavelet construction for Loop subdivision, based on the lifting scheme. Our wavelet transform uses scaling functions that are recursively defined by Loop...
99
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
103
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We address the problem of detecting batches of emails that have been created according to the same template. This problem is motivated by the desire to filter spam more effectivel...
99
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We combine linear discriminant analysis (LDA) and K-means clustering into a coherent framework to adaptively select the most discriminative subspace. We use K-means clustering to ...