Sciweavers

492 search results - page 14 / 99
» Fast data stream algorithms using associative memories
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 2 months ago
On High Dimensional Projected Clustering of Uncertain Data Streams
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
Charu C. Aggarwal
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
14 years 25 days ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
BMCBI
2010
88views more  BMCBI 2010»
13 years 7 months ago
FastTagger: an efficient algorithm for genome-wide tag SNP selection using multi-marker linkage disequilibrium
Background: Human genome contains millions of common single nucleotide polymorphisms (SNPs) and these SNPs play an important role in understanding the association between genetic ...
Guimei Liu, Yue Wang, Limsoon Wong
TKDE
2008
139views more  TKDE 2008»
13 years 7 months ago
Mining Weighted Association Rules without Preassigned Weights
Association rule mining is a key issue in data mining. However, the classical models ignore the difference between the transactions, and the weighted association rule mining does n...
Ke Sun, Fengshan Bai
ICS
2009
Tsinghua U.
14 years 2 months ago
Computer generation of fast fourier transforms for the cell broadband engine
The Cell BE is a multicore processor with eight vector accelerators (called SPEs) that implement explicit cache management through direct memory access engines. While the Cell has...
Srinivas Chellappa, Franz Franchetti, Markus P&uum...