Sciweavers

253 search results - page 42 / 51
» Fast algorithms for time series mining
Sort
View
SAC
2002
ACM
14 years 9 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
79
Voted
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
15 years 10 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
98
Voted
ICDM
2005
IEEE
163views Data Mining» more  ICDM 2005»
15 years 3 months ago
Efficient Text Classification by Weighted Proximal SVM
In this paper, we present an algorithm that can classify large-scale text data with high classification quality and fast training speed. Our method is based on a novel extension o...
Dong Zhuang, Benyu Zhang, Qiang Yang, Jun Yan, Zhe...
CRYPTO
2004
Springer
128views Cryptology» more  CRYPTO 2004»
15 years 3 months ago
Faster Correlation Attack on Bluetooth Keystream Generator E0
We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correla...
Yi Lu 0002, Serge Vaudenay
97
Voted
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
15 years 10 months ago
SPIRAL: efficient and exact model identification for hidden Markov models
Hidden Markov models (HMMs) have received considerable attention in various communities (e.g, speech recognition, neurology and bioinformatic) since many applications that use HMM...
Yasuhiro Fujiwara, Yasushi Sakurai, Masashi Yamamu...