415 search results - page 74 / 83 » An efficient approximation for the Generalized Assignment Pr... |
EDBT
2004
ACM
14 years 6 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
ICIP
1998
IEEE
13 years 11 months ago
1998
IEEE
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
CICLING
2010
Springer
13 years 10 months ago
2010
Springer
Term weighting strongly influences the performance of text mining and information retrieval approaches. Usually term weights are determined through statistical estimates based on s...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
ICC
2009
IEEE
13 years 4 months ago
2009
IEEE
OFDM/OQAM has been considered as an attractive alternative to classic OFDM with cyclic prefix (CP) over doubly dispersive channels. By utilising well designed pulse shapes and remo...