2600 search results - page 325 / 520 » Clustering with or without the Approximation |
151
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Under high mobility, the orthogonality between sub-carriers in an OFDM symbol is destroyed resulting in severe intercarrier interference (ICI). We present a novel algorithm to est...
168
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
210
click to vote
CRV
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...
162
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
271
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...